ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Sequential approximation”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.LGcs.DSTheoreticalRecentJun 22, 2026

Dynamic estimation of slowly varying sequences

Prashant Gokhale, Mikhail Khodak, Sandeep Silwal

The paper introduces a framework for sequentially approximating functions of elements in a slowly-varying sequence, improving upon previous work with a novel algorithm that scales the estimation budge…

View →
cs.LGcs.AIEmpiricalRecentOct 6, 2026

Reinforcement Learning with Conformal Action Sets: An Application to Sequential Recommendation

Wenwen Si, Honghao Wei

This paper proposes Reinforcement Learning with Calibrated Pruning (RLCP) to adaptively adjust the slate size in sequential recommenders.

View →
math.PRstat.MEstat.MLTheoreticalRecentJul 23, 2026

Self-Balancing Sequential Sampling: Fast Convergence with Controlled Predictability

Zachary McNulty, Daniel Raban

This paper presents a self-balancing sampler for sequential sampling that achieves faster convergence to a desired target law while maintaining unpredictability.

View →
math.NAstat.MLTheoreticalRecentJul 28, 2026

Sequential Preconditioned Conjugate Gradient Method for Linear Statistical Models

Guan-Yu Chen, Dong-Yue Xie, Xi Yang, Zun-Hao Zheng

This paper proposes a randomized iterative method called Sequential Preconditioned Conjugate Gradient Method (SPCG) for large-scale linear statistical models, which significantly reduces computational…

View →
cs.DSTheoreticalRecentOct 19, 2026

A Tight Oracle Threshold for \(k\)-Submodular Maximization

Siyuan Chen

The paper proves a lower bound on the number of value-oracle queries required for a certain type of approximation algorithm.

View →
math.OCcs.DMTheoreticalRecentJun 16, 2026

An Adaptive Algorithm for the Approximation of General Linear-Parametric Optimization Problems

Levin Nemesch, Stefan Ruzika, Clemens Thielen, Alina Wittmann

A new algorithm is proposed for approximating solutions to linear-multi-parametric optimization problems with negative parameter dependencies and non-fixed parameter sets.

View →
cs.ITcs.LGTheoreticalRecentJun 12, 2026

Nonlinear Two-Time-Scale Stochastic Approximation: A Sharp Phase Transition and How to Beat It

Dhruv Sarkar, Vaneet Aggarwal

This paper analyzes the finite-time behavior of nonlinear two-time-scale stochastic approximation and identifies a sharp boundary for decoupling the $k^{-1}$ rate.

View →
cs.AImath.OCRecentJun 1, 2026

Stochastic convergence of parallel asynchronous adaptive first-order methods

Serge Gratton, Philippe L. Toint

The paper analyzes a new class of asynchronous adaptive first-order optimization methods and proves their stochastic convergence rate is O(1/sqrt{t}) for non-convex functions.

View →
cs.DScs.AIcs.LGTheoreticalRecentJun 9, 2026

The Power of Test-Time Training for Approximate Sampling

Noah Golowich, Ankur Moitra, Dhruv Rohatgi

This paper formalizes test-time training (TTT) as a problem of sampling from a given probability measure and shows a quadratic lower bound on the query complexity of sampling.

View →
math.OCcs.CCcs.LGSurveyRecentOct 29, 2026

Stochastic and Noisy Oracles in Smooth Continuous Optimization

Albert S. Berahas, Liyuan Cao, Katya Scheinberg

This paper reviews models of inexact computational oracles in smooth continuous optimization and their implications for optimization algorithms.

View →
cs.LGcs.DSTheoreticalRecentJun 8, 2026

Online Learning with Recency: Algorithms for Sliding-window Streaming Multi-armed Bandits

Vladimir Braverman, Chen Wang, Liudeng Wang, Samson Zhou

This paper studies algorithms for single-pass sliding-window streaming multi-armed bandits with limited memory.

View →
math.STcs.MScs.SEEmpiricalRecentOct 11, 2026

Separating Statistical Inference from Experimental Runtime: An Architecture for Sequential Scientific Analysis

Alexander Stepanov, Andrej Novikov

The paper proposes an architecture for sequential statistical procedures that can be used in various applications.

View →
stat.MLcs.LGEmpiricalRecentOct 20, 2026

Near-Optimal Regret Bounds for UCB-Style Gaussian Process Bandits via Data Thinning

Shion Takeno, Shogo Iwazaki, Ichiro Takeuchi

This paper improves the regret upper bound of Gaussian process upper confidence bound (GP-UCB) algorithms via data thinning.

View →
cs.DSTheoreticalRecentJun 26, 2026

Incremental Submodular Maximization: Better Than Greedy

Marcin Bienkowski, Joakim Blikstad, Jarosław Byrka, Martín Costa +2 more

The paper presents an adaptive scaling algorithm with a competitive ratio of 1.373 for incremental submodular maximization under increasing cardinality constraint, improving upon the previous best res…

View →