Decentralized Learning of Quantile Regression: A Smoothing Approach
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 7307473 (Why is no real title available?)
- A Provably Communication-Efficient Asynchronous Distributed Inference Method for Convex and Nonconvex Problems
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
- Asynchronous Distributed ADMM for Large-Scale Optimization—Part I: Algorithm and<?Pub _newline ?>Convergence Analysis
- Communication-efficient distributed statistical inference
- Composite quantile regression for massive datasets
- Convergence of stochastic processes
- Discrete-time dynamic average consensus
- Distributed Algorithms for Composite Optimization: Unified Framework and Convergence Analysis
- Distributed Discrete-Time Optimization in Multiagent Networks Using Only Sign of Relative State
- EXTRA: an exact first-order algorithm for decentralized consensus optimization
- Fast linear iterations for distributed averaging
- Harnessing Smoothness to Accelerate Distributed Optimization
- Multiplier bootstrap for quantile regression: non-asymptotic theory under random design
- On the convergence of decentralized gradient descent
- Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008.
- Quantile regression.
- Smoothing Quantile Regressions
- Statistical methods and computing for big data
- Weak convergence and empirical processes. With applications to statistics
This page was built for publication: Decentralized Learning of Quantile Regression: A Smoothing Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6892353)
