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,742 papers · 148 categories

Trend · papers per month

2.3%4.6%6.8%9.1% · May 202619922001200920172026
48 results for noise regularisation

GNIs induce a regulariser that penalizes high-frequency components in neural network activations.

problem Understanding the regularizing effect of Gaussian noise injections on neural network activations.
method Deriving the explicit regularizer by marginalizing out injected noise and analyzing its effect in the Fourier domain.
result GNIs induce a regularizer that produces calibrated classifiers with large margins.

Noise regularisation in deep nets makes them behave like Gaussian processes.

problem Understanding the behavior of noise-regularized deep neural networks as Gaussian processes.
method Analyzing the impact of noise regularisation on neural network Gaussian processes (NNGPs) and relating their behavior to signal propagation theory.
result Best performing NNGPs have kernel parameters corresponding to a specific initialisation scheme.

New framework monitors neural network training and reveals regularisation mechanisms.

problem Overfitting in neural networks and the need for explicit regularizers.
method Model Gradient Similarity (MGS) framework to measure and monitor regularisation.
result Explicit regularizers increase Model Gradient Similarity (MGS).

Noise-driven neural networks emerge modular structures, improving robustness and generalization.

problem Artificial neural networks struggle with modular solutions, leading to poor generalization and robustness.
method Inspired by brain's modular architecture, the study uses neural noise and nonlinear responses to drive the emergence of modular solutions.
result Noise-driven modularisation improves robustness and generalization in neural networks.

Study on how noise and variation-norm regularisation help shallow ReLU networks use fewer neurons.

problem Understanding how shallow ReLU networks use a finite number of neurons in the infinitely wide limit.
method Analysis of two regularisation strategies: noise injection and variation-norm.
result Both regularisation methods minimize functions with a finite number of neurons, regardless of overparametrisation.

This paper examines the assumptions of the derived equivalence between dropout noise injection and L2L_2 regularisation for logistic regression with negative log loss. We show that the approximation method is based on a divergent Taylor expansion, making, subsequent work using this approximation to compare the dropout …

2019-05-27abs ↗pdf ↗

Denoising autoencoders (DAEs) have proven useful for unsupervised representation learning, but a thorough theoretical understanding is still lacking of how the input noise influences learning. Here we develop theory for how noise influences learning in DAEs. By focusing on linear DAEs, we are able to derive analytic ex…

2018-06-14abs ↗pdf ↗

A method improves Cryo-EM 3D map refinement by regularizing rotation estimation.

problem Noise-robustness vs. data-consistency in Cryo-EM 3D map reconstruction.
method Ellipsoidal support lifting (ESL) for regularizing and approximating the global minimizer over Riemannian manifolds.
result The induced bias due to regularizing effect of ESL estimates better rotations than global optimisation.

This work optimizes RL algorithms using entropy regularisation for continuous-time LQ problems.

problem Designing RL algorithms to balance exploration and exploitation in noisy environments.
method Entropy regularisation in two formulations: exploratory control and proximal policy update.
result Regret of O(N)\mathcal{O}(\sqrt{N}) for both learning algorithms over NN episodes.

Detect changes in noisy dynamical systems using empirical approximations and finite-sample bounds.

problem Change detection in noisy dynamical systems
method Partition-based empirical approximations and finite-state stationary distribution stability
result Finite-sample bound for empirical stationary density

New insights into how neural networks learn features, especially when they are very wide.

problem Understanding how gradient flow in wide neural networks selects solutions, especially in the feature-learning regime.
method Axiomatizing the canonical regularizer as a function-space energy and lift, and deriving geodesic ridge for the feature-learning regime.
result Gradient flow in feature-learning networks biases towards ridge regularization, distorting the inductive bias and damaging pretrained networks.

This research improves multimodal systems by adding a second objective and regularisation methods.

problem Improving performance of multimodal systems with multiple objectives and regularisation.
method Introduces a second objective over multimodal fusion using variational inference and regularisation methods.
result Demonstrates potential for multiple objectives and probabilistic methods to lower variance and improve generalisation.

Paper advances sparse regularisation theory for measures with new kernel insights.

problem Estimating sparse measures from noisy observations using continuous sparse regularisation.
method Develops new continuous sparse regularisation theory on measures with Beurling-LASSO, introduces kernel switch analysis.
result Proves the ``sinc-4'' kernel satisfies a technical LPC assumption for error bounds.

A new method for manifold learning using sparse regularised optimal transport.

problem Detecting latent manifolds in high-dimensional data with noisy observations.
method Proposes a symmetric version of optimal transport with quadratic regularisation to construct a sparse and adaptive affinity matrix.
result The method outperforms competing methods in numerical experiments and demonstrates robustness to heteroskedastic noise.

ProSelfLC improves robustness of deep neural networks by automatically deciding trust in predictions.

problem Training robust deep neural networks requires addressing issues like label noise and low entropy predictions.
method ProSelfLC progressively increases trust in predicted labels over time, considering entropy and learning time.
result ProSelfLC demonstrates improved robustness in both clean and noisy settings through empirical validation.

A trade-off exists between reconstruction quality and the prior regularisation in the Evidence Lower Bound (ELBO) loss that Variational Autoencoder (VAE) models use for learning. There are few satisfactory approaches to deal with a balance between the prior and reconstruction objective, with most methods dealing with t…

2019-09-09abs ↗pdf ↗

Improved graph-based connectivity estimation using heat modelling.

problem Lack of explicit model-based, dynamic, multivariate, and directed connectivity estimation methods.
method Noise-driven heat modelling on graphs with relaxed assumptions and regularisation.
result Demonstrated ability to capture meaningful spatial structure across real-world datasets.

This paper improves inverse problem solving with weakly convex regularisers and proves convergence.

problem Improving solution methods for inverse problems.
method Generalised formulation of convergent regularisation using weakly convex regularisers, and proof of convergence for primal-dual hybrid gradient method.
result Proves convergence of primal-dual hybrid gradient method for variational problems and shows improved performance with IWCNNs.

Generalised regularisation equals robustness for exotic function classes.

problem Adversarial examples highlight the need for robust models in exotic function classes.
method Equality result linking distributional robustness and Lipschitz regularisation.
result Certified robustness of Lipschitz-regularised models with mild assumptions.

Geometry-aware noise improves model generalization on complex manifolds.

problem Improving model generalization on highly curved data manifolds.
method Add geometry-aware noise to input space, projecting Gaussian noise onto tangent space of manifold and mapping it via geodesic curve.
result Geometry-aware noise leads to improved generalization and robustness on highly curved manifolds.

A Python package solves source duplication in single channel LVMs using spectral regularisation.

problem Source duplication in LVMs hampers their practical use in single channel applications.
method Spectral regularisation term added to address source duplication issue.
result Spectral regularisation framework enables easier investigation and utilisation of LVMs.

This paper addresses the issue of feature importance landscapes in complex images and proposes a regularisation technique to improve network performance.

problem Feature importance landscapes in complex images are not as uniform as assumed, affecting network performance.
method Developed the PILCRO objective to regularize weight configurations, making importance landscapes smoother and more data-driven.
result P-regularised networks have a flat importance landscape, train faster, and perform better in accuracy and robustness.

Proposes a new noise injection method for neural networks that improves accuracy and representation clarity.

problem Improving neural network performance and representation clarity.
method Adaptive Structured Noise Injection (ASNI) for shallow and deep neural networks.
result Boosts the accuracy of neural networks and disentangles hidden layer representations.

Single-cell RNA sequencing (scRNA-seq) is a fast growing approach to measure the genome-wide transcriptome of many individual cells in parallel, but results in noisy data with many dropout events. Existing methods to learn molecular signatures from bulk transcriptomic data may therefore not be adapted to scRNA-seq data…

2018-02-26abs ↗pdf ↗

This work uncovers algorithm-dependent regularisation in diffusion models.

problem Understanding and improving generalisation in high-dimensional diffusion models.
method Algorithmic stability and score stability analysis.
result Identifies multiple sources of implicit regularisation unique to diffusion models.

Study examines robust regression in high dimensions with heavy-tailed data.

problem Analyzing robust regression in high-dimensional settings with heavy-tailed data.
method Sharp asymptotic characterisation of M-estimators and ridge regression in elliptical distributions.
result Ridge regression is optimal and universal for finite second moments but can decay faster without them.

Despite recent advances in regularisation theory, the issue of parameter selection still remains a challenge for most applications. In a recent work the framework of statistical learning was used to approximate the optimal Tikhonov regularisation parameter from noisy data. In this work, we improve their results and ext…

2018-09-23abs ↗pdf ↗

GNIs induce asymmetric heavy-tailed noise in SGD, affecting network performance.

problem The effect of Gaussian noise injections on SGD dynamics and network performance.
method Developed a Langevin-like SDE driven by asymmetric heavy-tailed noise to model the modified SGD dynamics.
result GNIs induce an implicit bias that varies with noise heaviness and asymmetry, affecting network performance.

Novel approach finds implicit regularisation in two-player games using BEA.

problem Understanding implicit regularisation in two-player games.
method Using backward error analysis to construct continuous-time flows with gradient-eligible vector fields.
result Identifies new implicit regularisation effects in two-player games.

Regularization preserves topological data structure in autoencoders.

problem Ensuring topological data structure preservation in autoencoders.
method Regularization using Legendre nodes to preserve manifold embedding.
result Regularized autoencoders ensure one-to-one embedding of data manifolds.

Regularisation improves ML classifier stability against poisoning attacks.

problem Poisoning attacks degrade ML algorithms' performance; current attacks ignore hyperparameters.
method Proposed a multiobjective bilevel optimisation problem to consider hyperparameter effects.
result L2L_2 regularisation enhances learning algorithm stability and mitigates poisoning attacks.

Investigates gradient descent dynamics and introduces new regularisation methods.

problem Understanding and mitigating gradient descent instabilities and interactions with smoothness regularisation.
method Derives continuous-time flows to account for discretisation drift, constructs learning rate schedules and regularisers.
result New regularisation methods improve performance in reinforcement learning.

Researchers compare different gradient methods for ridge regression, finding conjugate gradients have similar performance.

problem Comparing statistical properties of different gradient methods in ridge regression.
method Explicit non-standard error decomposition to bound prediction error of conjugate gradient iterates.
result Conjugate gradient iterates share optimality properties with gradient flow and ridge regression up to a constant factor.

Marginalising out uncertain quantities within the internal representations or parameters of neural networks is of central importance for a wide range of learning techniques, such as empirical, variational or full Bayesian methods. We set out to generalise fast dropout (Wang & Manning, 2013) to cover a wider variety of …

2015-07-19abs ↗pdf ↗

Study on GD and SGD over diagonal networks, focusing on stepsizes and regularisation.

problem Understanding the impact of stochasticity and large stepsizes on gradient descent and SGD solutions.
method Investigation of GD and SGD over diagonal linear networks with macroscopic stepsizes, proving convergence and characterizing solutions.
result Large stepsizes consistently benefit SGD for sparse regression problems, but can hinder GD recovery of sparse solutions, especially in the edge of stability regime.

This work shows how penalising bias terms in norm regularisation leads to sparse solutions.

problem Understanding the relation between parameter norm regularization and the sparsity of neural network solutions.
method Analyzes one hidden ReLU layer networks with unidimensional data, showing the norm required for function representation and the importance of the bias term's norm.
result Penalising the bias terms in regularisation leads to sparse solutions, enforcing the uniqueness and sparsity of the minimal norm interpolator.

Deep models can fit noisy labels, but robustness and reliability are still issues.

problem Training deep models with noisy labels leads to unreliable uncertainty quantification.
method Analysis of conditional distribution over noisy labels and evaluation of robust loss functions.
result Strictly proper and robust loss functions preserve accuracy but do not guarantee reliability.

Regularizes ML algorithms for robust multivariate analysis against distribution shifts.

problem Ensuring robustness of multivariate analysis algorithms against distribution shifts.
method Integrates a causal regularisation term into the loss function of multivariate analysis algorithms.
result Demonstrates improved out-of-distribution generalisation with reduced-rank regression and partial least squares.

Paper studies particle method for LSV model calibration, proving convergence and error bounds.

problem Calibration of local-stochastic volatility models with open well-posedness question.
method Regularized Euler--Maruyama scheme for particle approximation of McKean--Vlasov dynamics.
result Strong convergence of the Euler--Maruyama scheme with rate 1/2 in step-size.