text: Then, we perform a hill-climbing style approach to find a good confounder for xi. For each iteration t ∈ [T ], where T is 
  the total number of iterations, do the following: 
  
  (1) Select a target index j ∈ [1, n] uniformly. 
  
  (2) Generate a set B of B + 1 candidates. First set ˜c0 = c(t) 
  i 
  
  , the current confounder. To generate B additional 
  b=1. Replace the jth token in the 
  
  <html>
          <head> <meta charset="UTF-8">
          <style>
          table, th, td {
              border: 1px solid black;
              font-size: 10px;
          }
          </style> </head>
          <body>
          <table frame="hsides" rules="groups" width="100%%">
              [html]<thead><tr><td>Table</td><td>Canadation ( s )</td></tr></thead><tbody><tr><td>Table</td><td>1,......................................................................................................................................................................................................</td></tr><tr><td>Table</td><td>Table</td></tr></tbody>
          </table> </body> </html>