23 citations · 101 across the 39 of their papers we have counts for
6 papers · 1 filter
Entropic Independence II: Optimal Sampling and Concentration via Restricted Modified Log-Sobolev Inequalities
Nima Anari, Vishesh Jain, Frederic Koehler +2
We introduce a framework for obtaining tight mixing times for Markov chains based on what we call restricted modified log-Sobolev inequalities. Modified log-Sobolev inequalities (M…
Learning Multimodal Rewards from Rankings
Vivek Myers, Erdem Bıyık, Nima Anari +1
Learning from human feedback has shown to be a useful approach in acquiring robot reward functions. However, expert feedback is often assumed to be drawn from an underlying unimoda…
Domain Sparsification of Discrete Distributions using Entropic Independence
Nima Anari, Michał Dereziński, Thuy-Duong Vuong +1
We present a framework for speeding up the time it takes to sample from discrete distributions defined over subsets of size of a ground set of elements, in the regime $…
Entropic Independence I: Modified Log-Sobolev Inequalities for Fractionally Log-Concave Distributions and High-Temperature Ising Models
Nima Anari, Vishesh Jain, Frederic Koehler +2
We introduce a notion called entropic independence that is an entropic analog of spectral notions of high-dimensional expansion. Informally, entropic independence of a background d…
From Sampling to Optimization on Discrete Domains with Applications to Determinant Maximization
Nima Anari, Thuy-Duong Vuong
We show a connection between sampling and optimization on discrete domains. For a family of distributions defined on size subsets of a ground set of elements that is closed…
Fractionally Log-Concave and Sector-Stable Polynomials: Counting Planar Matchings and More
Yeganeh Alimohammadi, Nima Anari, Kirankumar Shiragur +1
We show fully polynomial time randomized approximation schemes (FPRAS) for counting matchings of a given size, or more generally sampling/counting monomer-dimer systems in planar,…