C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Log-concave polynomials IV: approximate exchange, tight mixing times, and near-optimal sampling of forests.
Nima Anari
Kuikui Liu
Shayan Oveis Gharan
Cynthia Vinzant
Thuy-Duong Vuong
Published in:
STOC (2021)
Keyphrases
</>
lower bound
upper bound
worst case
sampling strategies
random sampling
sampling strategy
neural network
database
search engine
high dimensional
sampling methods
sampling algorithm
information exchange
generalization error bounds
random forests
monte carlo
sample size
feature extraction
learning algorithm
data mining