Co-occurring keywords · papers mentioning both
Papers
Privately Estimating Black-Box Statistics
COLT 2026
On the Statistical Efficiency of Mean-Field Reinforcement Learning with General Function Approximation
AISTATS 2024
Provable Representation with Efficient Planning for Partially Observable Reinforcement Learning
ICML 2024
Trajectory Data Suffices for Statistically Efficient Learning in Offline RL with Linear q^π-Realizability and Concentrability
NeurIPS 2024
A Fast and Accurate Estimator for Large Scale Linear Model via Data Averaging
NeurIPS 2023
A Non-parametric View of FedAvg and FedProx:Beyond Stationary Points
JMLR 2023
Pitfalls of Gaussians as a noise distribution in NCE
ICLR 2023
Polarity Is All You Need to Learn and Transfer Faster
ICML 2023
Provable benefits of score matching
NeurIPS 2023
Statistical Efficiency of Score Matching: The View from Isoperimetry
ICLR 2023
Beyond GNNs: An Efficient Architecture for Graph Problems
AAAI 2022
Jointly Efficient and Optimal Algorithms for Logistic Bandits
AISTATS 2022
A Unified Statistically Efficient Estimation Framework for Unnormalized Models
AISTATS 2020
Predicting Choice with Set-Dependent Aggregation
ICML 2020
Noise Contrastive Estimation and Negative Sampling for Conditional Models: Consistency and Statistical Efficiency
EMNLP 2018
On the Statistical Efficiency of Compositional Nonparametric Prediction
AISTATS 2018
Towards Stability and Optimality in Stochastic Gradient Descent
AISTATS 2016
Dealing with small data: On the generalization of context trees
ICML 2015
Computing Parametric Ranking Models via Rank-Breaking
ICML 2014
Generalized Method-of-Moments for Rank Aggregation
NeurIPS 2013
Sample Complexity of Composite Likelihood
AISTATS 2012
High-dimensional Variable Selection with Sparse Random Projections: Measurement Sparsity and Statistical Efficiency
JMLR 2010