Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

6.1%12.2%18.3%24.5% · May 202619922001200920172026
48 results for adaptive error

Study analyzes deep learning's performance on variable exponent Besov space, highlighting adaptivity benefits.

problem Estimation error analysis of deep learning in variable exponent Besov space.
method Analysis of general approximation error and estimation errors of deep learning.
result Adaptivity of deep learning leads to significant improvement in estimation error, especially in high-dimensional spaces.

Data-driven method for error estimation without needing class complexity.

problem Constructing confidence intervals for a class of estimates.
method Data-driven approach to derive high-probability upper bounds on maximum error.
result Method naturally adapts to unknown correlation structures and works for finite and infinite classes.

A new adaptive splitting method improves accuracy for Cox-Ingersoll-Ross model.

problem Improving numerical solution accuracy for Cox-Ingersoll-Ross model.
method Adaptive splitting method over deterministic and random meshes, with uniform moment bound and strong error results.
result Uniform moment bound and strong error results of order 1/4 in L1 and L2 for κθ>σ^2, and order 1 for large noise.

The paper tackles gradual domain adaptation with manifold-constrained DRO, showing error bounds across distributions.

problem Gradual domain adaptation challenge with manifold-constrained data distributions.
method Distributionally Robust Optimization (DRO) with an adaptive Wasserstein radius.
result Theoretical bounds on classification error across distributions, demonstrating error propagation dynamics.

LALR adapts learning rate for faster convergence in regression and neural nets.

problem Finding optimal learning rates for faster convergence in regression and neural networks.
method Lipschitz continuity theory applied to Mean Absolute Error and Quantile loss functions.
result Adaptive learning rate policy enables up to 20x faster convergence.

In recent years, correntropy has been seccessfully applied to robust adaptive filtering to eliminate adverse effects of impulsive noises or outliers. Correntropy is generally defined as the expectation of a Gaussian kernel between two random variables. This definition is reasonable when the error between the two random…

2019-11-21abs ↗pdf ↗

In this work, we present a novel upper bound of target error to address the problem for unsupervised domain adaptation. Recent studies reveal that a deep neural network can learn transferable features which generalize well to novel tasks. Furthermore, a theory proposed by Ben-David et al. (2010) provides a upper bound …

2019-10-03abs ↗pdf ↗

Adaptive importance samplers are adaptive Monte Carlo algorithms to estimate expectations with respect to some target distribution which \textit{adapt} themselves to obtain better estimators over a sequence of iterations. Although it is straightforward to show that they have the same O(1/N)\mathcal{O}(1/\sqrt{N}) convergen…

2019-03-28abs ↗pdf ↗

Paper proposes adaptive parameter selection for KGD algorithms.

problem Improving parameter selection for kernel-based gradient descent.
method Integrates bias-variance analysis with splitting method, introduces empirical effective dimension.
result Adaptive parameter selection strategy achieves optimal generalization error bound.

Paper adapts ACI for online multi-step time-series forecasting with coverage guarantees.

problem Achieving reliable error bounds in online multi-step time-series forecasting.
method Adaptive conformal inference (ACI) adapted for multi-step forecasting with dynamic significance levels.
result Proposes a multi-step ACI algorithm with finite-sample coverage guarantees for non-exchangeable data.

Calibrated probabilistic solvers improve accuracy of ODE estimates.

problem Uncertainty in probabilistic ODE solutions is not well-calibrated for adaptive step sizes.
method Introduce and assess several calibration methods for probabilistic ODE solvers.
result Calibration methods interact efficiently with adaptive step-size selection, improving posteriors.

This paper addresses the robust speech recognition problem as an adaptation task. Specifically, we investigate the cumulative application of adaptation methods. A bidirectional Long Short-Term Memory (BLSTM) based neural network, capable of learning temporal relationships and translation invariant representations, is u…

2019-06-14abs ↗pdf ↗

VCoTTA uses variational Bayesian methods to adapt models under continuous domain shifts.

problem Error accumulation in continual test-time adaptation.
method VCoTTA employs variational Bayesian techniques to update a Bayesian Neural Network (BNN) during testing, combining priors from source and teacher models.
result VCoTTA effectively mitigates error accumulation in CTTA, as shown by experimental results on three datasets.

Adapts Neyman-Pearson classification for both source and target distribution shifts.

problem Minimizing errors while controlling both Type-I and Type-II errors under distribution shifts.
method Derives an adaptive procedure that guarantees improved error rates and adapts to uninformative sources.
result Automatic adaptation to uninformative sources avoids negative transfer.

New insights into variable selection with different model assumptions.

problem Sparse recovery with \ell_\infty error guarantees in variable selection.
method Separation between oblivious and adaptive models of \ell_\infty sparse recovery.
result Proves a surprising contrast between oblivious and adaptive models in \ell_\infty sparse recovery.

Adaptive optimization methods, which perform local optimization with a metric constructed from the history of iterates, are becoming increasingly popular for training deep neural networks. Examples include AdaGrad, RMSProp, and Adam. We show that for simple overparameterized problems, adaptive methods often find drasti…

2017-05-23abs ↗pdf ↗

Selective state-adaptive regularization improves offline RL performance.

problem Extrapolation errors and value overestimation in static dataset RL.
method State-adaptive regularization coefficients trust Bellman-driven results selectively.
result Significant improvement in performance on D4RL benchmark.

New algorithm learns changing discrete distributions with minimal drift error.

problem Learning discrete distributions that change over time with limited past samples.
method Adaptive algorithm using data-dependent bounds to balance statistical and drift errors.
result Tighter statistical error bounds for drifting distributions with or without finite support.

Self-training improves gradual domain adaptation with unlabeled data.

problem Improving machine learning models' adaptability to gradually shifting data distributions.
method Proved upper bounds on self-training error, highlighted the importance of regularization and label sharpening, and demonstrated algorithmic insights.
result Self-training works well for gradual shifts, especially with small Wasserstein-infinity distance.

New robust estimator improves variable selection and coefficient estimation in linear regression with heavy-tailed errors and outliers.

problem Heavy-tailed errors and anomalous predictors in high-dimensional regression.
method Adaptive PENSE estimator for robust variable selection and estimation.
result Adaptive PENSE estimator provides reliable results even under very heavy-tailed errors and aberrant predictors.

Due to the ability of deep neural nets to learn rich representations, recent advances in unsupervised domain adaptation have focused on learning domain-invariant features that achieve a small error on the source domain. The hope is that the learnt representation, together with the hypothesis learnt from the source doma…

2019-01-27abs ↗pdf ↗

New method uses online learning to improve AIPW estimators for adaptively collected data.

problem Estimating treatment effects with adaptively collected data.
method Online learning to minimize sequentially weighted estimation error.
result Local minimax lower bound shows optimality of AIPW estimator.

The paper analyzes sparse high-dimensional linear regression with random design and unknown error variance, providing adaptiveness and concentration rates.

problem Sparse high-dimensional linear regression with random design and unknown error variance.
method Analysis of posterior concentration rates, employing techniques to address model misspecification.
result Adaptiveness and concentration rates of the posterior for sparse high-dimensional linear regression.

A new data-adaptive prior stabilizes kernel learning in operators.

problem Learning kernels in operators from data is ill-posed due to nonlocal dependence.
method Introduces a data-adaptive prior to stabilize the Bayesian posterior mean.
result The data-adaptive prior achieves a stable posterior with small noise limits.

Method aggregates models with different hyper-parameters to adapt to target domain.

problem Choosing hyper-parameters for unsupervised domain adaptation.
method Linear aggregation of models with different hyper-parameters using weighted least squares for vector-valued functions.
result The target error is asymptotically not worse than twice the error of the optimal aggregation.

Latent FxLMS accelerates ANC by adapting along low-dimensional filter weights.

problem Improving active noise control with neural adaptive filters.
method Training an auto-encoder on filter coefficients, constraining weights to latent variables, and updating in latent space.
result Latent FxLMS converges in fewer steps with comparable error to standard FxLMS.

Transfer Learning (TL) in Deep Neural Networks is gaining importance because in most of the applications, the labeling of data is costly and time-consuming. Additionally, TL also provides an effective weight initialization strategy for Deep Neural Networks . This paper introduces the idea of Adaptive Transfer Learning …

2018-10-30abs ↗pdf ↗

We study the problem of estimating a set of dd linear queries with respect to some unknown distribution p\mathbf{p} over a domain J=[J]\mathcal{J}=[J] based on a sensitive data set of nn individuals under the constraint of local differential privacy. This problem subsumes a wide range of estimation tasks, e.g., distrib…

2018-10-05abs ↗pdf ↗

Adaptive algorithm identifies best arm with abstention, showing phase transition from polynomial to exponential error probability.

problem Bayesian best-arm identification with abstention to reduce undetected error.
method Adaptive algorithm PGWS that optimally uses abstention budget.
result Introducing any positive abstention budget induces an exponential decay in undetected error probability.

New algorithm for adaptive experimental design in scientific settings.

problem Identifying true positives while controlling false discoveries in adaptive experimental design.
method Provably sample efficient adaptive algorithm for FDR control.
result First provably sample efficient adaptive algorithm for adaptive experimental design.

Introduces Cauchy-Schwarz divergence for domain adaptation.

problem Evaluating discrepancy between source and target domains in unsupervised domain adaptation.
method Introduces Cauchy-Schwarz divergence as a measure for evaluating discrepancy between marginal and conditional distributions.
result CS divergence offers a tighter generalization error bound than Kullback-Leibler divergence.

New algorithms adaptively calibrate predictions in non-stationary environments, matching optimal rates.

problem Designing online prediction algorithms that adapt to varying levels of non-stationarity.
method Epoch-based scheduling and non-uniform partitioning of the prediction space.
result Achieves adaptive calibration guarantees under multiple measures with optimal rates.

Artificial neural network training with stochastic gradient descent can be destabilized by "bad batches" with high losses. This is often problematic for training with small batch sizes, high order loss functions or unstably high learning rates. To stabilize learning, we have developed adaptive learning rate clipping (A…

2019-06-21abs ↗pdf ↗

Adaptive learning method for stochastic programs with latent uncertainty.

problem Stochastic programming problems with implicitly decision-dependent uncertainty.
method Adaptive learning-based surrogate method integrating simulation and statistical estimates.
result Established non-asymptotic convergence rate analysis for enhanced stability and efficiency.

New method controls false discoveries in real-time data streams.

problem Online testing of hypotheses with strict error constraints and no future data.
method Structure-adaptive sequential testing (SAST) with alpha-investment algorithm.
result Substantial power gain over existing online testing rules.