Enhances UPSA to reduce noise in financial data.
problem Noise in financial data affects UPSA's performance.
method Time-averaging optimal penalty weights and using Average Oracle correlation eigenvalues.
result Combining time-averaging and Average Oracle correlation eigenvalues improves UPSA's performance.
Local averaging accurately distills manifold structure from noisy data.
problem Tackles the challenge of uncovering manifold structure from noisy data.
method Two-round mini-batch local averaging method applied to noisy samples.
result Achieves accuracy bound of $d(\hat{\mathbf q}, \mathcal M) \leq σ\sqrt{d\left(1+\frac{κ\mathrm{diam}(\mathcal {M})}{\log(D)}
ight)}$.
Noise-resilient method improves Hurst exponent estimation accuracy in noisy data.
problem Noise degrades accuracy of Hurst exponent estimation methods.
method Noise-Controlled ALPHEE (NC-ALPHEE) using wavelet multi-scale analysis and neural network combination.
result NC-ALPHEE consistently outperforms existing techniques in noisy conditions.
Sparsity promoting norms are frequently used in high dimensional regression. A limitation of such Lasso-type estimators is that the optimal regularization parameter depends on the unknown noise level. Estimators such as the concomitant Lasso address this dependence by jointly estimating the noise level and the regressi…
FA-LD algorithm improves uncertainty quantification and mean predictions in federated learning.
problem Uncertainty quantification and mean predictions in federated learning with distributed clients.
method FA-LD algorithm for strongly log-concave distributions with non-i.i.d data, considering general models.
result The FA-LD algorithm provides theoretical guarantees for convergence and optimal noise injection.
Robustly computes intrinsic coordinates on point clouds using resampling and averaging.
problem Computing intrinsic coordinates on noisy or outlier-prone point clouds.
method Subsample data, vary hyperparameters, cluster candidate embeddings, identify representative embeddings, and average them using Procrustes analysis.
result Robust to noise and outliers, validated on synthetic and real data.
Improves consistency of weighted averaging estimators in active learning.
problem Consistency issues in weighted averaging estimators under active learning.
method Enforces random sampling through an augmented active learning algorithm.
result Generalizes Stone's Theorem for consistency of estimators under active learning.
Paper tackles leverage effect estimation from noisy data.
problem Estimating leverage effect from high-frequency data with microstructure noise.
method Holistic multi-scale framework operating directly on leverage effect, using Subsampling-and-Averaging Leverage Effect (SALE) and Multi-Scale Leverage Effect (MSLE) estimators.
result Holistic multi-scale framework achieves substantial efficiency gains over existing benchmarks.
This work analyzes nonexpansive stochastic approximations with Markovian noise, proving convergence in reinforcement learning.
problem Applying stochastic approximation to reinforcement learning settings with nonexpansive operators.
method Investigates nonexpansive stochastic approximations with Markovian noise, providing asymptotic and finite sample analysis.
result First-time proof of convergence for classical tabular average reward temporal difference learning.
We present a noise-injected version of the Expectation-Maximization (EM) algorithm: the Noisy Expectation Maximization (NEM) algorithm. The NEM algorithm uses noise to speed up the convergence of the EM algorithm. The NEM theorem shows that injected noise speeds up the average convergence of the EM algorithm to a local…
Measures three types of noise in LLM evaluations.
problem Separating signal from noise in LLM experiments.
method Defined and measured three types of noise: prediction, data, and total noise. Proposed the all-pairs paired method for statistical power.
result Total noise level is characteristic and predictable across all model pairs.
New method for spot volatility estimation with reduced microstructure noise.
problem Estimating spot volatility from noisy high-frequency data.
method Pre-averaging/kernel estimator to handle microstructure noise.
result Optimal bandwidth selection and kernel functions for minimal variance.
The objective function of a matrix factorization model usually aims to minimize the average of a regression error contributed by each element. However, given the existence of stochastic noises, the implicit deviations of sample data from their true values are almost surely diverse, which makes each data point not equal…
Unified theory explains and mitigates double descent in data reconstruction.
problem Understanding and mitigating double descent in reduced order modeling.
method Data-Noise Averaging theory, sufficient criteria, detailed risk curve prediction, regularization mechanisms.
result Detailed risk curves predicted at reduced computational cost, instability traced to individual sensors.
A method refines weights to estimate smooth manifolds from noisy data.
problem Estimating smooth manifolds from noisy data.
method Structure-adaptive procedure that iteratively refines weights using structural information.
result The method achieves nearly optimal performance even with large noise.
New methods for estimating ARMA and GARCH models with stable noise.
problem Estimating parameters of ARMA and GARCH models with stable noise.
method Modified Hannan-Rissanen Method and Modified Empirical Characteristic Function for estimation.
result Efficiency, accuracy, and simplicity of proposed methods demonstrated through simulation.
New averaging technique speeds up Newton method convergence.
problem Superlinear convergence of stochastic Newton methods with noisy Hessians.
method Hessian averaging to reduce noise and maintain superlinear convergence.
result Hessian averaging achieves superlinear convergence with a non-asymptotic rate.
New stability analysis improves generalization of multipass SGD.
problem Improper preconditioning affects generalization in multipass SGD.
method Developed on-average stability analysis for multipass SGD.
result Proper preconditioning yields optimal effective dimension dependence.
We analyze the generalization and robustness of the batched weighted average algorithm for V-geometrically ergodic Markov data. This algorithm is a good alternative to the empirical risk minimization algorithm when the latter suffers from overfitting or when optimizing the empirical risk is hard. For the generalization…
The study examines how averaging data improves model performance.
problem Understanding the generalization gap in machine learning models.
method Data averaging, covariance analysis, and stochastic gradient descent (SGD) noise modeling.
result A modified generalization gap is always non-negative for a large class of model parameter distributions.
Study on SA with heavy-tailed and LRD noise, establishing finite-time bounds.
problem Analyzing stochastic approximation under heavy-tailed and LRD noise.
method Noise-averaging argument to regularize impact of non-classical noise.
result Established first finite-time moment bounds for SA under heavy-tailed and LRD noise.
FedHDPrivacy uses DP to improve FL in IoT, maintaining high accuracy.
problem Privacy threats in FL, especially in IoT environments.
method Integrates DP with neuro-symbolic computing, actively monitoring and adjusting noise.
result Maintains high performance in manufacturing monitoring, surpassing other FL methods.
We introduce an autoregressive-type model with self-modulation effects for a foreign exchange rate by separating the foreign exchange rate into a moving average rate and an uncorrelated noise. From this model we indicate that traders are mainly using strategies with weighted feedbacks of the past rates in the exchange …
Algorithm learns stochastic system dynamics from data.
problem Recovering interpretable symbolic expressions for stochastic systems.
method Data-driven, trajectory averaging, drift-informed correction.
result Recover coefficients and densities to within 5% and 0.01 in total variation, respectively.
We formulate and study a general family of (continuous-time) stochastic dynamics for accelerated first-order minimization of smooth convex functions. Building on an averaging formulation of accelerated mirror descent, we propose a stochastic variant in which the gradient is contaminated by noise, and study the resultin…
Improved self-distillation reduces label noise and enhances model accuracy.
problem Label noise in multi-class classification.
method Label averaging and refined partial labels.
result Single-round self-distillation achieves comparable performance to multi-round distillation.
Paper provides tail bounds for stochastic mirror descent in heavy-tailed noise.
problem Optimizing convex and Lipschitz functions with heavy-tailed noise.
method Develops tail bounds for optimization error of Stochastic Mirror Descent.
result Tail bounds extend to heavier-tailed noise regimes without diameter constraints.
Improved averaging method for noisy observations converges strongly.
problem Noisy observations from random dynamical systems require stable estimates.
method Introduced p-EMA, a modified exponential moving average with subharmonic weight decay. result Stochastic convergence guarantees for p-EMA under mild assumptions. Noise stability improves understanding of Transformer models.
problem Lack of robustness metrics for real-valued domains and junta-like input dependence in modern LLMs.
method Proposed noise stability as a new metric and developed a practical regularization method.
result Noise stability regularization method accelerates training by 35-75%.
This paper proposes a simple but effective graph-based agglomerative algorithm, for clustering high-dimensional data. We explore the different roles of two fundamental concepts in graph theory, indegree and outdegree, in the context of clustering. The average indegree reflects the density near a sample, and the average…
Behavior cloning training instabilities amplified by SGD noise over long horizons.
problem Training instabilities in behavior cloning with deep neural networks.
method Empirical dissection of minibatch SGD updates and their effects on long-horizon rewards.
result Exponential moving average (EMA) of iterates effectively mitigates gradient variance amplification (GVA).
Stochastic gradient methods enable learning probabilistic models from large amounts of data. While large step-sizes (learning rates) have shown to be best for least-squares (e.g., Gaussian noise) once combined with parameter averaging, these are not leading to convergent algorithms in general. In this paper, we conside…
TT-DAC-PS: A deterministic actor-critic approach for optimal trade execution
problem Optimal execution of large stock sell programs
method Twin-Target Deterministic Actor-Critic with Policy Smoothing
result Reduces mean implementation shortfall percentage
The expected low market penetration of connected vehicles (CVs) in the near future could be a constraint in estimating traffic flow parameters, such as average travel speed of a roadway segment and average space headway between vehicles from the CV broadcasted data. This estimated traffic flow parameters from low penet…
Generative model for financial time series using structured noise and signature learning.
problem Creating synthetic financial data to reflect real-world market dynamics.
method Structured noise, moving average model, signature transform, reinforcement learning.
result Model effectively captures key financial characteristics and outperforms existing methods.
Paper proposes a new method for training diffusion models using Markov operators.
problem Training efficiency and accuracy in diffusion models.
method Operator-informed score matching using spectral decomposition of Markov operators.
result Improved score matching for both low and high-dimensional distributions.
The so-called level crossing analysis has been used to investigate the empirical data set. But there is a lack of interpretation for what is reflected by the level crossing results. The fractional Gaussian noise as a well-defined stochastic series could be a suitable benchmark to make the level crossing findings more s…
New research shows that binary classification can be done with noisy data, but only if there are clean samples available.
problem Learning binary classification with instance and label dependent label noise.
method Theoretical analysis and empirical risk minimization.
result Empirical risk minimization achieves the optimal excess risk bound without additional assumptions.
New convergence rates for SGD under heavy-tailed noise with infinite variance.
problem Convergence analysis of SGD under heavy-tailed noise with infinite variance.
method Identifying a condition on the Hessian and providing a convergence rate for the distance to the global optimum.
result SGD can converge to the global optimum under heavy-tailed noise with infinite variance.
Drone optimizes collaborative learning for neural networks.
problem Training a shared neural network with heterogeneous data from multiple devices.
method Drone collects and aggregates model parameters from devices, optimizing trajectory for best accuracy.
result Significant improvement in final accuracy and speedup in training time.
The paper tackles learning to control systems with unknown parameters using Brownian noise.
problem Learning to control systems with unknown parameters.
method Proposes algorithms based on moving empirical averages and integrates statistical methods with stochastic control theory.
result Achieves a logarithmic expected regret rate.
Persistent homology detects curvature from sampled points.
problem Understanding the geometric information encoded in short intervals of persistent homology.
method Persistent homology computations and average persistence landscapes.
result Persistent homology detects curvature of disks from sampled points.
Improved DP-SGD for variational inference reduces noise and variance.
problem Poor convergence and high variance in variational parameter outputs due to gradient noise in DP-SGD.
method Introduced aligned gradients and iterate averaging to reduce DP-induced noise, and noise-aware posteriors.
result Less noisy gradient estimator and improved parameter estimates for variational inference.
Stochastic algo learns from evolving data, achieving optimal performance.
problem Performative prediction and multiplayer extensions.
method Stochastic approximation with decision-dependent distributions.
result Asymptotic normality and optimality of the algorithm's performance.
Optimizes control of noisy discrete systems without system matrix knowledge.
problem Optimal control of discrete-time systems with additive and multiplicative noises.
method Stochastic Lyapunov and Riccati equations, model-free reinforcement learning.
result Model-free reinforcement learning algorithm converges to optimal control policy.
The paper investigates how dataset quality and heterogeneity affect model confidence in machine learning.
problem Understanding how dataset quality and heterogeneity impact model confidence in machine learning.
method The study uses theoretical explanations and experimental demonstrations to investigate the effects of dataset size, label noise, and class heterogeneity on model confidence.
result Label noise reduces model confidence, while reduced dataset size increases it, and class heterogeneity leads to inconsistent confidence across classes.
Paper analyzes LSA algorithm bias and error bounds with RR extrapolation.
problem Analyzing bias and high-order error bounds of LSA with Markovian noise.
method Polyak-Ruppert averaging, linearization, Richardson-Romberg extrapolation.
result RR extrapolation effectively cancels the leading bias term.
A new model captures irregularly spaced high-frequency prices and their volatility.
problem Modeling high-frequency prices with irregular spacing and market noise.
method Observation-driven model using Skellam distribution with time-varying volatility and smoothing splines.
result The model provides a good fit to IBM stock data and measures daily realized volatility.