20 results for “Sequential approximation”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
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…
This paper proposes Reinforcement Learning with Calibrated Pruning (RLCP) to adaptively adjust the slate size in sequential recommenders.
This paper presents a self-balancing sampler for sequential sampling that achieves faster convergence to a desired target law while maintaining unpredictability.
This paper proposes a randomized iterative method called Sequential Preconditioned Conjugate Gradient Method (SPCG) for large-scale linear statistical models, which significantly reduces computational…
The paper proves a lower bound on the number of value-oracle queries required for a certain type of approximation algorithm.
A new algorithm is proposed for approximating solutions to linear-multi-parametric optimization problems with negative parameter dependencies and non-fixed parameter sets.
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.
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.
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.
This paper reviews models of inexact computational oracles in smooth continuous optimization and their implications for optimization algorithms.
This paper studies algorithms for single-pass sliding-window streaming multi-armed bandits with limited memory.
The paper proposes an architecture for sequential statistical procedures that can be used in various applications.
This paper improves the regret upper bound of Gaussian process upper confidence bound (GP-UCB) algorithms via data thinning.
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…