Nima Anari
where else to find them
what they talk about
where they keep going back
- ITCS2 editions2021–2022
all 6 in the filters
on a stage with
- Aaron Schildonce
- Amin Saberionce
- Elizabeth Yangonce
all 6 in the filters
who talks about the same things
- Amin Saberi6 talks
- Yuval Filmus9 talks
- Makrand Sinha5 talks
- Farzam Ebrahimnejad2 talks
- Pasin Manurangsi8 talks
- Dor Minzer8 talks
| title | conference | date |
|---|---|---|
| Parallel Discrete Sampling via Continuous Walks | Beyond the Boolean Cube 2023 | 2023-06-26 |
Claims first polylogarithmic-time sampling (quasi-RNC or RNC under extra stability) for determinantal point processes, spanning trees and directed Eulerian… | ||
| Domain Sparsification of Discrete Distributions using Entropic Independence | ITCS 2022 | 2022-01-31 |
Proves that for any distribution satisfying entropic independence with parameter alpha a preprocessed sampler reduces the ground set from N to about… | ||
| Sampling Arborescences in Parallel | ITCS 2021 | 2021-01-06 |
Claims an RNC sampler that outputs a rooted arborescence from a weighted digraph with probability proportional to product of edge weights, running in polylog… | ||
| Discrete Optimization using Log-Concave Polynomials | Hyperbolic Polynomials and Hyperbolic Programming | 2019-04-30 |
Shows a concrete algorithmic pipeline: relax the 0/1 max-coefficient integer program to a continuous program over the polynomial G_mu, solve when G_mu is… | ||
| Approximate Deterministic Counting via Marginal Entropy Optimization | Deterministic Counting, Probability, and Zeros of Partition Functions (Simons Institute workshop, 2019) | 2019-03-18 |
Deterministic algorithm maximizes the sum of marginal entropies over the matroid base polytope via convex optimization (using a separation oracle) and… | ||
| Counting and Optimization Using Stable Polynomials | Hierarchies, Extended Formulations and Matrix-Analytic Techniques (2017) | 2017-11-06 |
Shows that for distributions whose generating polynomial is real-stable the log of the set size is approximable by the sum of edge marginals up to a… | ||
| Approximating the Permanent of Positive Semidefinite Matrices | Discrete Optimization via Continuous Relaxation | 2017-09-11 |
Proves a deterministic algorithm that approximates the permanent of any positive semidefinite matrix to a simply exponential factor (≈ e^{γ+1}^n), using a… | ||
| nothing matches | ||