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

1122 · Mar 202619922001200920172026
17 results for noise-adaptive

VFMs use noise adapters to conditionally generate images in one step.

problem Conditional image generation with iterative models is slow and requires explicit sampling paths.
method Developed a variational flow map framework that learns noise distributions for conditional sampling.
result VFMs achieve well-calibrated conditional samples in a single forward pass.

This work introduces a noise-adaptive conformal inference method for better prediction sets in noisy data.

problem Real-world complications like random label noise limit the effectiveness of conformal inference.
method An adaptive conformal inference method capable of handling deviations from exchangeability.
result Informative prediction sets with tight marginal coverage guarantees in noisy data.

Improved SHB method for faster convergence on strongly-convex quadratics.

problem Understanding and improving the theoretical and practical advantages of SHB.
method Noise-adaptive multi-stage algorithm for SHB with accelerated convergence.
result SHB can achieve accelerated convergence with larger mini-batch sizes.

New methods learn DAGs from noisy data, adapting to noise levels.

problem Inferring causal relationships from observational data with noise and confounding.
method Reformulate DAG learning as a continuous optimization problem over adjacency matrices, jointly inferring structure and noise levels.
result Improved robustness to heteroscedasticity and distribution shifts.

Existence of strong randomized equilibria in mean-field games with common noise.

problem Existence of strong solutions in mean-field games of optimal stopping.
method Connection with Bank-El Karoui's representation problem and continuity assumptions.
result Existence of strong randomized mean-field equilibrium under certain conditions.

A new method for faster optimization of noisy functions.

problem Optimizing noisy functions efficiently.
method A universal and adaptive second-order method for convex functions.
result Achieves O(σ/T)O(σ/ \sqrt{T}) convergence for stochastic oracles and O(1/T3)O( 1 / T^3) for deterministic oracles.

We revisit the Bayesian online inference problems for the linear dynamic systems (LDS) under non- Gaussian environment. The noises can naturally be non-Gaussian (skewed and/or heavy tailed) or to accommodate spurious observations, noises can be modeled as heavy tailed. However, at the cost of such noise robustness, the…

2015-04-22abs ↗pdf ↗

High throughput biomedical measurements normally capture multiple overlaid biologically relevant signals and often also signals representing different types of technical artefacts like e.g. batch effects. Signal identification and decomposition are accordingly main objectives in statistical biomedical modeling and data…

2017-10-23abs ↗pdf ↗

Adapts SGD to noise and problem specifics for faster convergence.

problem Minimizing smooth, strongly-convex functions with varying noise and problem constants.
method Adaptive SGD with exponentially decreasing step-sizes, Nesterov acceleration, and stochastic line-search.
result Achieves near-optimal convergence rates without knowing noise or problem specifics.

This paper analyzes M-estimators under infinite-variance noise in high dimensions.

problem High-dimensional M-estimation with infinite-variance noise.
method Study of the Fenchel conjugate domain and its impact on risk.
result Exact risk of M-estimators under infinite-variance noise is derived.

Unified framework for distributed compressed SGD under (L0,L1)(L_0, L_1)-smoothness.

problem Understanding the joint effect of batch noise, adaptivity, and compression in distributed stochastic optimization.
method Developed a unified theoretical framework using SDEs that incorporate curvature-dependent terms.
result Normalizing updates in DCSGD stabilizes convergence, with normalization degree determined by noise structure and landscape regularity.

Novel confidence sets improve linear bandit performance by adapting to unknown noise levels.

problem Adapting to unknown noise levels in sequential decision-making.
method Proposed semi-adaptive and variance-adaptive confidence sets.
result Improved regret bounds and better performance in Bayesian optimization tasks.

Adaptive algorithms improve performance in non-convex optimization across various scenarios.

problem Improper handling of noise scales, gradient magnitudes, and smoothness in non-convex optimization.
method Design and analysis of noise-adaptive, scale-free, and generalized algorithms.
result Adaptive algorithms achieve optimal rates and performance in diverse optimization settings.