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 · Jul 202019922001200920172026
21 results for Self-Tuning

The paper proves convergence of graph Laplacian with kNN self-tuned kernels.

problem Theoretical and practical challenges in choosing kernel bandwidth for graph-based analysis.
method Develops and analyzes a new family of kNN self-tuned kernels for graph Laplacian convergence.
result Proves convergence of graph Laplacian to manifold Laplacian for new kNN self-tuned kernels.

AlgoPerf competition evaluates neural network training speed-ups.

problem Improving neural network training speed using better algorithms.
method Compared 18 diverse submissions from 10 teams on multiple workloads.
result Schedule Free AdamW algorithm achieved best results in self-tuning ruleset.

Improved SGD with AdaGrad stepsizes adapts to unknown parameters and unbounded gradients.

problem Adaptive optimization with unknown parameters and unbounded gradients.
method Stochastic Gradient Descent with AdaGrad stepsizes, without assuming problem parameters or strong global Lipschitz conditions.
result Sharp rates of convergence in both low-noise and high-noise regimes, supporting an affine variance noise model.

Machine and reinforcement learning (RL) are increasingly being applied to plan and control the behavior of autonomous systems interacting with the physical world. Examples include self-driving vehicles, distributed sensor networks, and agile robots. However, when machine learning is to be applied in these new settings,…

2019-06-27abs ↗pdf ↗

Estimates model performance under distribution shift using domain-invariant predictors.

problem Poor performance of models on test distributions different from training distributions.
method Uses domain-invariant predictors as a proxy for unknown target labels.
result Shows that the complexity of latent representations influences target risk.

GAIL is a recent successful imitation learning architecture that exploits the adversarial training procedure introduced in GANs. Albeit successful at generating behaviours similar to those demonstrated to the agent, GAIL suffers from a high sample complexity in the number of interactions it has to carry out in the envi…

2018-09-06abs ↗pdf ↗

Improved hypernetwork for efficient neural network hyperparameter tuning.

problem Efficiently optimizing hyperparameters in neural networks.
method Proposed ΔΔ-STN architecture focusing on accurate best-response Jacobian approximation.
result Significantly improved hyperparameter tuning accuracy and stability.

New hyperparameter ensembles boost neural network performance and uncertainty.

problem Improving neural network robustness and uncertainty quantification.
method Designing ensembles over both weights and hyperparameters, stratified across random initializations.
result Hyper-deep and hyper-batch ensembles outperform deep and batch ensembles on various architectures.

AdaGrad-Norm achieves optimal convergence rates for non-convex objectives without tuning.

problem Optimal convergence rates for non-convex, smooth objectives with adaptive step sizes.
method Adaptive SGD (AdaGrad-Norm) with self-tuning step sizes, analyzing under unbounded gradients and affine variance scaling.
result AdaGrad-Norm achieves order optimal convergence rate of $\mathcal{O}\left(\frac{\mathrm{poly}\log(T)}{\sqrt{T}} ight)$ under optimal assumptions.

The inference of correlated signal fields with unknown correlation structures is of high scientific and technological relevance, but poses significant conceptual and numerical challenges. To address these, we develop the correlated signal inference (CSI) algorithm within information field theory (IFT) and discuss its n…

2016-12-26abs ↗pdf ↗

Improved convergence rate for kNN graph Laplacians with adaptive bandwidth.

problem Enhancing the efficiency of graph-based data analysis methods.
method Introducing a new class of kNN graph with adaptive bandwidth and proving operator convergence rate.
result Operator convergence rate of O(N2/(d+6))O(N^{-2/(d+6)}) for the kNN graph Laplacian, up to a log factor.