conftrace_

sampling without replacement

12 papers

Explore in graph

Co-occurring keywords · papers mentioning both

random reshuffling (3) stochastic gradient descent (3) confidence sequence (2) without-replacement sampling (2) convergence rate (2) randomized algorithm (2) stochastic beam search (1) arithmetic-geometric mean inequality (1) least squares optimization (1) sequential estimation (1)

Papers

A New Concentration Inequality for Sampling Without Replacement and Its Application for Transductive Learning ICML 2025 Gambling-Based Confidence Sequences for Bounded Random Vectors ICML 2024 Generalization Analysis of Stochastic Weight Averaging with General Sampling ICML 2024 Random Reshuffling with Variance Reduction: New Analysis and Better Rates UAI 2023 Policy improvement by planning with Gumbel ICLR 2022 Sampling without Replacement Leads to Faster Rates in Finite-Sum Minimax Optimization NeurIPS 2022 Ancestral Gumbel-Top-k Sampling for Sampling Without Replacement JMLR 2020 Confidence sequences for sampling without replacement NeurIPS 2020 Incremental Sampling Without Replacement for Sequence Models ICML 2020 Random Reshuffling is Not Always Better NeurIPS 2020 Probability Inequalities for Kernel Embeddings in Sampling without Replacement AISTATS 2016 Toward a Noncommutative Arithmetic-geometric Mean Inequality: Conjectures, Case-studies, and Consequences COLT 2012