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

Trend · papers per month

4008001,1991,599 · Jun 202019922001200920172026
48 results for gradient modeling

Gradient descent implicitly regularizes neural networks by penalizing large loss gradients.

problem How to optimize deep neural networks without explicit regularization.
method Backward error analysis to calculate implicit gradient regularization and demonstrate its effectiveness empirically.
result Implicit gradient regularization biases gradient descent toward flat minima, improving model robustness and test errors.

Gradient model for memristive systems in neurophysiology and neuromorphic circuits.

problem Understanding and modeling memristive systems.
method Introducing a gradient modeling framework based on Chua's definition of memristive elements.
result Gradient properties of memristive systems have implications for neuromorphic circuit analysis and design.

Reinforcement learning algorithms such as the deep deterministic policy gradient algorithm (DDPG) has been widely used in continuous control tasks. However, the model-free DDPG algorithm suffers from high sample complexity. In this paper we consider the deterministic value gradients to improve the sample efficiency of …

2019-09-09abs ↗pdf ↗

Optimal defenses protect FL models from gradient reconstruction attacks.

problem Gradient reconstruction attacks compromise FL models by recovering original data from shared gradients.
method Derive a theoretical lower bound of reconstruction error, customize noise and pruning defenses, and achieve optimal trade-off between leakage and utility.
result Our methods outperform Gradient Noise and Pruning in protecting training data and maintaining model utility.

Gradient sparsification enhances privacy-preserving machine learning models.

problem Improving performance of differentially-private machine learning models under privacy constraints.
method Gradient sparsification combined with compressed sensing and additive Laplace noise.
result Gradient sparsification can improve performance of differentially-private machine learning models for small privacy budgets.

A method to improve gradient boosting models using stacking.

problem Improving the performance of gradient boosting models.
method Proposes a stacking algorithm to learn a meta-model for ensembles of gradient boosting models.
result The proposed approach can be extended to differentiable combination models like neural networks.

Gradient rollback explains neural models by identifying influential training examples.

problem Explain predictions of neural black-box models, especially in applications requiring user trust.
method Gradient rollback, a general approach for influence estimation applicable to neural models with limited parameter updates.
result Gradient rollback provides faithful explanations for neural models, including knowledge graph embedding methods.

This research tackles uncertainty in gradient boosting models using ensemble methods.

problem Quantifying uncertainty in gradient boosting models for high-risk applications.
method Probabilistic ensemble-based framework for gradient boosting classification and regression models.
result Ensembles of gradient boosting models detect anomalous inputs but have limited ability to improve total uncertainty.

New research shows input-gradients can be manipulated without changing model's core function, challenging their use for model interpretation.

problem Current methods for model interpretability using input-gradients are flawed due to their arbitrary manipulability.
method Investigated by reinterpreting logits as unnormalized log-densities, proposing novel approximations for score-matching.
result Improving alignment between implicit density model and data distribution enhances gradient structure and explanatory power.

MAGE optimizes policies using action gradients from model-based learning.

problem Lack of direct gradient information from critics in actor-critic methods.
method Model-based actor-critic algorithm that learns action-value gradient.
result MAGE outperforms model-free and model-based baselines on continuous control tasks.

A new estimator improves training of probabilistic models with latent Gaussian variables.

problem Improving gradient estimation for models with latent Gaussian variables.
method Rao-Blackwellised Reparameterisation Gradients (R2-G2)
result R2-G2 consistently yields better performance in models with multiple applications of the reparameterisation trick.

Variational inference approximates the posterior distribution of a probabilistic model with a parameterized density by maximizing a lower bound for the model evidence. Modern solutions fit a flexible approximation with stochastic gradient descent, using Monte Carlo approximation for the gradients. This enables variatio…

2017-04-19abs ↗pdf ↗

Gradient amplification boosts deep learning model performance without increasing training time.

problem Vanishing gradients in deep neural networks.
method Gradient amplification approach to prevent vanishing gradients and training strategy to enable/disable across epochs.
result Improves performance of deep learning models with reduced training time.

A scalable method for BED with implicit models using approximate gradients.

problem Efficiently estimating posterior distribution and maximizing MI for implicit models.
method Stochastic approximate gradient ascent with smoothed variational MI estimator.
result Significantly improves scalability of BED in high-dimensional problems.

Gradient-enhanced deep GPs improve multifidelity model accuracy.

problem Improving accuracy in multifidelity models using gradient data.
method Extending deep Gaussian processes to incorporate gradient data.
result Gradient-enhanced deep GP outperforms other models in predicting aerodynamic coefficients.

Paper develops unbiased gradient estimator for continuous-time models.

problem Estimating unbiased gradient of log-likelihood for continuous-time models.
method Doubly randomized scheme with coupled conditional particle filter (CCPF).
result Unbiased gradient estimate facilitates gradient-based algorithms.

New findings on optimal transport gradient for generative models, addressing numerical instabilities.

problem Numerical instabilities in training Wasserstein Generative Adversarial Networks (WGAN).
method Valid differentiation theorem for entropic regularized transport, semi-discrete gradient formulation, and optimization algorithm.
result Existence of optimal transport gradient for generative models under specified conditions.

We introduce a simple algorithm, True Asymptotic Natural Gradient Optimization (TANGO), that converges to a true natural gradient descent in the limit of small learning rates, without explicit Fisher matrix estimation. For quadratic models the algorithm is also an instance of averaged stochastic gradient, where the par…

2017-12-22abs ↗pdf ↗

Adaptive batch sizes improve local gradient methods in distributed training.

problem Communication bottlenecks in distributed deep learning.
method Adaptive batch size strategies for local gradient methods.
result Adaptive batch sizes reduce minibatch gradient variance and improve training efficiency.

Variational inference transforms posterior inference into parametric optimization thereby enabling the use of latent variable models where otherwise impractical. However, variational inference can be finicky when different variational parameters control variables that are strongly correlated under the model. Traditiona…

2019-03-07abs ↗pdf ↗

In this work we revisit gradient regularization for adversarial robustness with some new ingredients. First, we derive new per-image theoretical robustness bounds based on local gradient information. These bounds strongly motivate input gradient regularization. Second, we implement a scaleable version of input gradient…

2019-05-27abs ↗pdf ↗

Recent advances in policy gradient methods and deep learning have demonstrated their applicability for complex reinforcement learning problems. However, the variance of the performance gradient estimates obtained from the simulation is often excessive, leading to poor sample efficiency. In this paper, we apply the stoc…

2017-10-17abs ↗pdf ↗

New approach improves model generalization through distributionally robust learning.

problem Improving model generalization in machine learning.
method Stochastic gradient descent applied to the outer minimization problem, with gradient estimation through multi-level Monte Carlo randomization.
result Our approach yields significant benefits over previous work in numerical experiments.

Proposes a new method to improve deep model security against adversarial deformations.

problem Deep neural networks' resistance to adversarial attacks, especially location perturbations.
method Regularizes flow gradients to provide a tighter bound and improve model resistance.
result Models trained with flow gradient regularization show better resistance to adversarial deformations compared to input gradient regularization and adversarial training.

Study shows gradient variance increases during deep learning training, contrary to common belief.

problem Understanding and minimizing gradient variance in deep learning models.
method Gradient Clustering method using stratified sampling to minimize gradient variance.
result Gradient variance increases during training, and smaller learning rates coincide with higher variance.

Paper proposes recycling model updates in federated learning by exploiting low-rank gradient subspaces.

problem Large parameter transmissions in federated learning.
method Look-back Gradient Multiplier (LBGM) algorithm exploiting low-rank property of gradient subspaces.
result LBGM reduces communication overhead with minimal performance loss.

Gradient descent and its many variants, including mini-batch stochastic gradient descent, form the algorithmic foundation of modern large-scale machine learning. Due to the size and scale of modern data, gradient computations are often distributed across multiple compute nodes. Unfortunately, such distributed implement…

2018-05-25abs ↗pdf ↗

Mini-batch stochastic gradient descent (SGD) and variants thereof approximate the objective function's gradient with a small number of training examples, aka the batch size. Small batch sizes require little computation for each model update but can yield high-variance gradient estimates, which poses some challenges for…

2019-10-18abs ↗pdf ↗

Unified derivation of high-dimensional linear models using stochastic gradient descent.

problem Performance analysis of high-dimensional linear models trained with stochastic gradient descent.
method Derivation of a deterministic equivalence for the two-point function of a random matrix resolvent.
result Unified understanding of model performance including previously known and novel results.

Gradient boosting enhances existing Mendelian models for genetic disease risk prediction.

problem Improving existing Mendelian models for genetic disease risk prediction.
method Combining gradient boosting with existing Mendelian models.
result Improved model outperforms both original and gradient boosting-only models.

LoRA-One uses one-step full gradient to align adapters for efficient large model fine-tuning.

problem Fine-tuning large language models efficiently and accurately.
method Properly initializing LoRA adapters using the one-step full gradient and incorporating preconditioners.
result LoRA-One achieves significant empirical improvements over existing methods.

The paper analyzes how adding gradient data affects overparameterized models' performance.

problem The impact of Sobolev training on high-dimensional predictive models.
method Combining replica method from statistical physics and operator-valued free probability theory.
result Sobolev training does not universally improve performance for target functions described by single-index models.