arXiv (All)
open access
Generalization Guarantees on Data-Driven Tuning of Gradient Descent with Langevin Updates
We study learning to learn through the lens of hyperparameter tuning. We propose the Langevin Gradient Descent Algorithm (LGD), which approximates the mean of the posterior distribution defined by the loss function and regularizer of a regression task with convex objective. For classification tasks,
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Denoising as Projection: Constrained Optimization with Gradient-Guided Diffusion#999861
- High-Probability Guarantees for SGD under $β$-Heavy-Tailed Gradient Noise#1116526
- Online Convex Optimization with Sublinear Noisy Probes#271829
- Policy-Calibrated DAgger: Offline Calibrated Noise Injection for Imitation Learning#1104661
- A Contraction Framework for Stochastic Operators with Bootstrapping: Application to TD Learning#1078032
Record · ID 997484
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive