Co-occurring keywords · papers mentioning both
Papers
Experimental Design for Semiparametric Bandits
COLT 2025
Near Optimal Non-asymptotic Sample Complexity of 1-Identification
ICML 2025
Learning the Uncertainty Sets of Linear Control Systems via Set Membership: A Non-asymptotic Analysis
ICML 2024
Nonasymptotic analysis of Stochastic Gradient Hamiltonian Monte Carlo under local conditions for nonconvex optimization
JMLR 2024
Sample Complexity Reduction via Policy Difference Estimation in Tabular Reinforcement Learning
NeurIPS 2024
A Statistical Analysis of Polyak-Ruppert Averaged Q-Learning
AISTATS 2023
Statistical Analysis of Karcher Means for Random Restricted PSD Matrices
AISTATS 2023
Iterative Double Sketching for Faster Least-Squares Optimization
ICML 2022
ROOT-SGD: Sharp Nonasymptotics and Asymptotic Efficiency in a Single Algorithm
COLT 2022
Sqrt(d) Dimension Dependence of Langevin Monte Carlo
ICLR 2022
Non-Asymptotic Analysis for Two Time-scale TDC with General Smooth Function Approximation
NeurIPS 2021
Sample Complexity Bounds for Two Timescale Value-based Reinforcement Learning Algorithms
AISTATS 2021
A Non-Asymptotic Analysis for Stein Variational Gradient Descent
NeurIPS 2020
Nonasymptotic Guarantees for Spiked Matrix Recovery with Generative Priors
NeurIPS 2020
POLY-HOOT: Monte-Carlo Planning in Continuous Space MDPs with Non-Asymptotic Analysis
NeurIPS 2020
Non-asymptotic Analysis of Biased Stochastic Approximation Scheme
COLT 2019
Two Time-scale Off-Policy TD Learning: Non-asymptotic Analysis over Markovian Samples
NeurIPS 2019
Beating Monte Carlo Integration: a Nonasymptotic Study of Kernel Smoothing Methods
AISTATS 2018
Adaptive Clustering through Semidefinite Programming
NeurIPS 2017
Learning the dependence structure of rare events: a non-asymptotic study
COLT 2015
Kernels Based Tests with Non-asymptotic Bootstrap Approaches for Two-sample Problems
COLT 2012
Non-Asymptotic Analysis of Stochastic Approximation Algorithms for Machine Learning
NeurIPS 2011