arXiv (All)
open access
Online simultaneous inference for quantiles via smoothed stochastic gradient descent
This paper considers the estimation of quantiles via a smoothed version of the stochastic gradient descent (SGD) algorithm. By smoothing the score function with a bandwidth tied to the learning rate, we obtain estimates that are monotone in the quantile level at every iteration, while retaining the
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
- AdAdaGrad: Adaptive Batch Size Schemes for Adaptive Gradient Methods#670271
- AdAdaGrad: Adaptive Batch Size Schemes for Adaptive Gradient Methods#668206
- Stannic: Systolic STochAstic ONliNe SchedulIng AcCelerator#149305
- Accelerated Gradient Descent for Faster Convergence with Minimal Overhead#196460
- On the performance of efficient portfolios#492939
Record · ID 820204
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