English
Related papers

Related papers: Dual Free Adaptive Mini-batch SDCA for Empirical R…

200 papers

We propose a trust-region method for finite-sum minimization with an adaptive sample size adjustment technique, which is practical in the sense that it leads to a globally convergent method that shows strong performance empirically without…

Optimization and Control · Mathematics 2019-10-09 Robert Mohr , Oliver Stein

This paper considers multiple binary hypothesis tests with adaptive allocation of sensing resources from a shared budget over a small number of stages. A Bayesian formulation is provided for the multistage allocation problem of minimizing…

Methodology · Statistics 2014-11-05 Dennis Wei

The scalability of statistical estimators is of increasing importance in modern applications. One approach to implementing scalable algorithms is to compress data into a low dimensional latent space using dimension reduction methods. In…

Machine Learning · Statistics 2015-04-14 Gregory Darnell , Stoyan Georgiev , Sayan Mukherjee , Barbara E Engelhardt

Minibatch decomposition methods for empirical risk minimization are commonly analysed in a stochastic approximation setting, also known as sampling with replacement. On the other hands modern implementations of such techniques are…

Machine Learning · Computer Science 2023-01-09 Edouard Pauwels

Conventional test-time adaptation (TTA) approaches typically adapt the model using only a small fraction of test samples, often those with low-entropy predictions, thereby failing to fully leverage the available information in the test…

Computer Vision and Pattern Recognition · Computer Science 2026-04-21 Nam Nguyen Phuong , Duc Nguyen The Minh , Phi Le Nguyen , Ehsan Abbasnejad , Minh Hoai

We explore an explicit link between stochastic gradient descent using common batching strategies and splitting methods for ordinary differential equations. From this perspective, we introduce a new minibatching strategy (called Symmetric…

Optimization and Control · Mathematics 2025-04-08 Luke Shaw , Peter A. Whalley

Minimax optimization is gaining increasing attention in modern machine learning applications. Driven by large-scale models and massive volumes of data collected from edge devices, as well as the concern to preserve client privacy,…

Machine Learning · Computer Science 2024-11-15 Miaoxi Zhu , Yan Sun , Li Shen , Bo Du , Dacheng Tao

Randomized iterative algorithms have attracted much attention in recent years because they can approximately solve large-scale linear systems of equations without accessing the entire coefficient matrix. In this paper, we propose two novel…

Numerical Analysis · Mathematics 2021-10-22 Kui Du , Xiao-Hui Sun

We study the minimax estimation of $\alpha$-divergences between discrete distributions for integer $\alpha\ge 1$, which include the Kullback--Leibler divergence and the $\chi^2$-divergences as special examples. Dropping the usual…

Information Theory · Computer Science 2021-03-04 Yanjun Han , Jiantao Jiao , Tsachy Weissman

Sampling-based methods, e.g., Deep Ensembles and Bayesian Neural Nets have become promising approaches to improve the quality of uncertainty estimation and robust generalization. However, they suffer from a large model size and high latency…

Machine Learning · Computer Science 2024-05-29 Ha Manh Bui , Anqi Liu

The accuracy of deep neural networks is significantly affected by how well mini-batches are constructed during the training step. In this paper, we propose a novel adaptive batch selection algorithm called Recency Bias that exploits the…

Machine Learning · Computer Science 2020-12-24 Hwanjun Song , Minseok Kim , Sundong Kim , Jae-Gil Lee

Following the recently developed algorithms for fully probabilistic control design for general dynamic stochastic systems [15], [18], this paper presents the solution to the probabilistic dual heuristic programming (DHP) adaptive critic…

Optimization and Control · Mathematics 2018-01-09 Randa Herzallah

In this paper, we present a simple analysis of {\bf fast rates} with {\it high probability} of {\bf empirical minimization} for {\it stochastic composite optimization} over a finite-dimensional bounded convex set with exponential concave…

Machine Learning · Statistics 2017-09-12 Tianbao Yang , Zhe Li , Lijun Zhang

A central approach to algorithmic derandomization is to construct probability distributions with small support that "fool" randomized algorithms, often enabling efficient parallel (NC) implementations. An abstraction of this idea is fooling…

Data Structures and Algorithms · Computer Science 2026-01-27 Jeff Giliberti , David G. Harris

We propose a new stochastic dual coordinate ascent technique that can be applied to a wide range of regularized learning problems. Our method is based on Alternating Direction Multiplier Method (ADMM) to deal with complex regularization…

Machine Learning · Statistics 2013-11-05 Taiji Suzuki

We consider the setting of iterative learning control, or model-based policy learning in the presence of uncertain, time-varying dynamics. In this setting, we propose a new performance metric, planning regret, which replaces the standard…

Machine Learning · Computer Science 2021-03-01 Naman Agarwal , Elad Hazan , Anirudha Majumdar , Karan Singh

We consider an experiment with at least two stages or batches and $O(N)$ subjects per batch. First, we propose a semiparametric treatment effect estimator that efficiently pools information across the batches, and show it asymptotically…

Methodology · Statistics 2023-09-28 Harrison H. Li , Art B. Owen

Empirical Bayes small area estimation based on the well-known Fay-Herriot model may produce unreliable estimates when outlying areas exist. Existing robust methods against outliers or model misspecification are generally inefficient when…

Methodology · Statistics 2022-06-28 Daisuke Kurisu , Takuya Ishihara , Shonosuke Sugasawa

This paper develops a flexible method for decreasing the variance of estimators for complex experiment effect metrics (e.g. ratio metrics) while retaining asymptotic unbiasedness. This method uses the auxiliary information about the…

Statistics Theory · Mathematics 2019-04-09 Reza Hosseini , Amir Najmi

We propose a general yet simple theorem describing the convergence of SGD under the arbitrary sampling paradigm. Our theorem describes the convergence of an infinite array of variants of SGD, each of which is associated with a specific…

Machine Learning · Computer Science 2021-02-22 Robert Mansel Gower , Nicolas Loizou , Xun Qian , Alibek Sailanbayev , Egor Shulgin , Peter Richtarik
‹ Prev 1 4 5 6 7 8 10 Next ›