Guy Bresler
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 4 in the filters
on a stage with
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| A Few Simple Average-Case Reduction Techniques And Their Surprising Effectiveness | Rigorous Evidence for Information-Computation Trade-offs | 2021-09-13 |
Shows concrete polynomial-time maps from planted‑clique variants to many statistical tasks, claiming simple linear transforms explain apparent computational… | ||
| Reducibility and Statistical-Computational Gaps from Secret Leakage | Computational Phase Transitions (Simons Institute, 2020) | 2020-09-21 |
Introduces secret leakage planted clique, a generalization where clique locations follow a distribution rho and is conjectured hard whenever two independent… | ||
| Learning a Tree-Structured Ising Model in Order to Make Predictions | Approximate Counting, Markov Chains and Phase Transitions | 2016-02-22 |
Claim: learning a tree Ising model only to get accurate pairwise posteriors needs far fewer samples than learning the exact graph. Method: compute empirical… | ||
| Lucky Talk: Low-regret Recommendations and Item-item Collaborative Filtering | Information Theory, Learning and Big Data (Simons Institute, 2015) | 2015-03-16 |
Matrix of binary likes, random user per round, bandit feedback and regret defined as average 1 - like; initial recommendations behave like random guessing with… | ||
| nothing matches | ||