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.

169,051 papers · 148 categories

Trend · papers per month

6.3%12.5%18.8%25.0% · Oct 199319922001200920172026
48 results for confidence control

LqgOpt learns optimal control in unknown LQG systems with minimal regret.

problem Adaptive control in partially observable linear quadratic Gaussian systems with unknown dynamics.
method Optimism in the face of uncertainty, predictor state evolution, closed-loop system identification, confidence bounds.
result Proves a regret upper bound of ildeO(T) ilde{\mathcal{O}}(\sqrt{T}) for LQG systems.

Adapts model-based advice to stabilize black-box policies for nonlinear control.

problem Stabilizing machine-learned policies for nonlinear control with limited model information.
method Proposes an adaptive λλ-confident policy to combine black-box and model-based advice.
result Proves the stability of the adaptive λλ-confident policy and its competitive ratio.

The study examines when to trust confidence thresholding in pseudo-labelling regression.

problem Calibrated probabilities from classifiers used for pseudo-labelling need careful handling to avoid bias in downstream regression.
method Developed a diagnostic apparatus to predict and bound the bias induced by confidence thresholding, derived a closed-form expression for the attenuation bias.
result The bias can be predicted from the residual score variance VV^{*}, motivating a structural separation between classifier features and downstream controls.

This work formalizes guidance in diffusion models and introduces a stochastic control framework.

problem Lack of a solid theoretical foundation for guidance scheduling in diffusion models.
method Introduces a stochastic optimal control framework to cast guidance scheduling as an adaptive optimization problem.
result Establishes a principled foundation for more effective guidance in diffusion models.

The paper uses conformal prediction to detect railway signals with confidence.

problem Deploying deep learning models in certified systems requires accurate uncertainty estimates.
method The paper uses conformal prediction and risk control to detect railway signals.
result The conformal prediction framework provides reliable and trustworthy uncertainty estimates for model performance.

Bootstrap method for Markov chains in reinforcement learning.

problem Distributional consistency in finite controlled Markov chains with unknown control policies.
method Model-based bootstrap with novel LLN and CLT for visitation counts and transition increments.
result Asymptotically valid confidence intervals for value and QQ-functions in offline RL.

Efficient inference method for adaptive experiments with tighter confidence sequences.

problem Efficient inference of Average Treatment Effect in a changing policy sequential experiment.
method Semiparametric efficient inference using Adaptive Augmented Inverse-Probability Weighted estimator and asymptotic confidence sequences.
result Derives tighter confidence sequences for adaptive experiments under data-dependent stopping times.

Bayesian framework for encoding uncertainty and inducing sparsity.

problem Handling uncertainty and inducing sparsity in statistical models.
method General Bayesian framework with explicit encoding of uncertainty and sparsity-inducing approach.
result Effective in linear and logistic regression, and Bayesian neural networks.

Clarifies the confidence interval approach for bioequivalence testing.

problem Ensuring the reliability of bioequivalence testing methods.
method Clarifies the conditions under which a 100(1-2α)% confidence interval yields a size-α test.
result A 100(1-2α)% confidence interval approach for bioequivalence testing yields a size-α test only when the two one-sided tests are 'equal-tailed'.

A new method for evaluating and selecting policies in contextual bandits improves confidence intervals and policy quality.

problem Evaluating and selecting policies in contextual bandits with logged data.
method Self-normalized Importance Weighting (SN) estimator with Efron-Stein tail inequality and multiplicative bias control.
result The method provides tighter confidence intervals and better policy selection compared to competitors.

In this paper we propose a new methodology for solving an uncertain stochastic Markovian control problem in discrete time. We call the proposed methodology the adaptive robust control. We demonstrate that the uncertain control problem under consideration can be solved in terms of associated adaptive robust Bellman equa…

2017-06-07abs ↗pdf ↗

Semi-analytical approach for optimal wealth management contributions.

problem Optimizing contributions to achieve a financial goal with uncertain returns.
method Controlled backward Kolmogorov equation and Schrodinger equation solution.
result Semi-analytical solutions for efficient frontiers in control space.

Efficiently solves exploration-exploitation in LQR using Lagrangian relaxation.

problem Exploration-exploitation dilemma in linear quadratic regulator (LQR) setting.
method Relax optimistic optimization into a constrained extended LQR problem, then solve using Riccati equations.
result Computes εε-optimistic controller efficiently with O(log(1/ε))O\big(\log(1/ε)\big) Riccati equations.

The goal of confidence-set learning in the binary classification setting is to construct two sets, each with a specific probability guarantee to cover a class. An observation outside the overlap of the two sets is deemed to be from one of the two classes, while the overlap is an ambiguity region which could belong to e…

2018-09-28abs ↗pdf ↗

Reduces change detection to estimation using confidence sequences.

problem Detecting changes in data streams with minimal delay and false alarms.
method Reduction from sequential change detection to sequential estimation using confidence sequences.
result Change detection scheme with minimal structural assumptions and strong guarantees.

This work uses statistical bootstrapping to provide accurate confidence intervals for policy value in reinforcement learning.

problem Bias in estimating policy value using empirical transitions and rewards.
method Statistical bootstrapping to produce calibrated confidence intervals for the true policy value.
result Statistical bootstrapping can yield correct confidence intervals under certain conditions, and mechanisms are proposed to mitigate these conditions.

Hypothesis testing in the linear regression model is a fundamental statistical problem. We consider linear regression in the high-dimensional regime where the number of parameters exceeds the number of samples (p>np> n). In order to make informative inference, we assume that the model is approximately sparse, that is th…

2017-04-26abs ↗pdf ↗

The paper evaluates index-based allocation policies using data from randomized control trials.

problem Evaluating index-based allocation policies in resource-scarce scenarios.
method Using data from randomized control trials, the paper introduces an efficient estimator and methods for computing asymptotically correct confidence intervals.
result Valid statistical conclusions can be drawn for index-based allocation policies.

The paper proposes a method to identify model uncertainty in mechanical presses using optimal design of experiments.

problem Model uncertainties in forming machines impair controller performance.
method Parameter identification, optimal design of experiments, and hypothesis testing.
result Identifies inconsistencies in parameter estimates as indicators of model uncertainty.

New method identifies diffusion sources on networks with statistical confidence.

problem Identifying sources of diffusion on networks without restrictive assumptions.
method Statistical framework and confidence set inference approach based on hypothesis testing.
result Efficiently produces a small subset of nodes covering the source node with any confidence level.

Optimal control in changing systems without strong convexity assumptions.

problem Adversarial changes in convex costs for unknown linear systems.
method Non-convex lower confidence bounds and computationally-efficient regret minimization.
result Achieves T\smash{\sqrt{T}}-regret rate, optimal compared to best stabilizing controller.

Generative AI reduces IR evaluation costs but introduces errors; this work provides reliable CIs.

problem Generating relevance annotations using AI introduces errors that affect IR evaluation metrics.
method Proposes two methods: prediction-powered inference and conformal risk control to place reliable CIs around IR metrics.
result Proposed methods accurately capture both variance and bias in evaluation based on AI-generated annotations.

The paper improves confidence ellipsoids for ridge regression with PAC bounds.

problem Uncertainty quantification in ridge regression for insufficiently exciting inputs.
method Extension of SPS EOA algorithm to ridge regression with PAC bounds.
result Explicitly shows how regularization parameter affects region sizes and provides tighter bounds.

Framework calibrates ML models for risk control in various tasks.

problem Achieving statistical guarantees for model predictions.
method Reframing risk control as multiple hypothesis testing, applying statistical techniques.
result New calibration methods for multi-label classification, instance segmentation, outlier detection, and confidence set coverage.

LLMs generate answers under incomplete context, and their uncertainty should scale with missing information.

problem Evaluating the quality of LLM answers under incomplete context.
method A controlled framework with varying context availability, and two uncertainty measures (sampling-based confidence and response entropy) evaluated on SQuAD.
result Response entropy increases with context removal and explains more variance in accuracy than confidence, suggesting it is a more responsive uncertainty measure.

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.

Nonparametric modeling approaches show very promising results in the area of system identification and control. A naturally provided model confidence is highly relevant for system-theoretical considerations to provide guarantees for application scenarios. Gaussian process regression represents one approach which provid…

2018-11-16abs ↗pdf ↗

Simple method for estimating missing panel data entries with confidence intervals.

problem Estimating missing values in panel data with staggered adoption.
method Simple matrix algebra and singular value decomposition for estimation, with data-driven confidence intervals.
result Confidence intervals match non-asymptotic lower bounds, proving instance optimality.

RLFA estimates misstated monetary fraction with weighted sampling without replacement.

problem Estimating misstated monetary fraction with given accuracy and confidence.
method Developed new confidence sequences for weighted average of unknown values using randomized weighted sampling and side information.
result Adaptive methods improve accuracy of estimates based on side information's predictive power.

The paper develops adaptive confidence intervals for Efron's Gaussian two-groups model with unknown contamination.

problem Developing robust uncertainty quantification for Efron's Gaussian two-groups model with unknown contamination fraction.
method The approach involves Fourier-based certification procedures to find minimax-optimal adaptive confidence intervals.
result The minimax-optimal length of adaptive confidence intervals is polynomially worse than when contamination fraction is known.

The paper tackles high-dimensional mixed linear regression with unknown parameters and proposes methods for estimation, confidence intervals, and hypothesis testing.

problem High-dimensional mixed linear regression with unknown parameters and covariance structure.
method Iterative high-dimensional EM algorithm for estimating regression vectors, debiased estimators for individual coordinates, and large-scale multiple testing procedure.
result Asymptotic normality of debiased estimators and FDR control for hypothesis testing.