Cover Image

$ψ$DAG: Projected Stochastic Approximation Iteration for DAG Structure Learning

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ziu, Klea, Hanzely, Slavomír, Li, Loka, Zhang, Kun, Takáč, Martin, Kamzolov, Dmitry
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Sketch-and-Project Meets Newton Method: Global $\mathcal O(k^{-2})$ Convergence with Low-Rank Updates
by: Hanzely, Slavomír
Published: (2023)

Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees
by: Agafonov, Artem, et al.
Published: (2025)

Newton Method Revisited: Global Convergence Rates up to $\mathcal {O}\left(k^{-3} \right)$ for Stepsize Schedules and Linesearch Procedures
by: Hanzely, Slavomír, et al.
Published: (2024)

SANIA: Polyak-type Optimization Framework Leads to Scale Invariant Stochastic Algorithms
by: Abdukhakimov, Farshed, et al.
Published: (2023)

Preconditioned Norms: A Unified Framework for Steepest Descent, Quasi-Newton and Adaptive Methods
by: Veprikov, Andrey, et al.
Published: (2025)

Stochastic Gradient Methods with Preconditioned Updates
by: Sadiev, Abdurakhmon, et al.
Published: (2022)

AdaBatchGrad: Combining Adaptive Batch Size and Adaptive Step Size
by: Ostroukhov, Petr, et al.
Published: (2024)

Loss-Transformation Invariance in the Damped Newton Method
by: Shestakov, Alexander, et al.
Published: (2025)

Polyak Stepsize: Estimating Optimal Functional Values Without Parameters or Prior Knowledge
by: Abdukhakimov, Farshed, et al.
Published: (2025)

OPTAMI: Global Superlinear Convergence of High-order Methods
by: Kamzolov, Dmitry, et al.
Published: (2024)

Cubic Regularized Newton Method with Variance Reduction for Finite-sum Non-convex Problems
by: Pasechnyuk-Vilensky, Dmitry, et al.
Published: (2025)

Exploiting higher-order derivatives in convex optimization methods
by: Kamzolov, Dmitry, et al.
Published: (2022)

A Learning Method with Gap-Aware Generation for Heterogeneous DAG Scheduling
by: Zhou, Ruisong, et al.
Published: (2026)

Edge Generation Scheduling for DAG Tasks Using Deep Reinforcement Learning
by: Sun, Binqi, et al.
Published: (2023)

Random-reshuffled SARAH does not need a full gradient computations
by: Beznosikov, Aleksandr, et al.
Published: (2021)

Federated Learning Can Find Friends That Are Advantageous
by: Tupitsa, Nazarii, et al.
Published: (2024)

Exploring Jacobian Inexactness in Second-Order Methods for Variational Inequalities: Lower Bounds, Optimal Algorithms and Quasi-Newton Approximations
by: Agafonov, Artem, et al.
Published: (2024)

Concentration of Contractive Stochastic Approximation: Additive and Multiplicative Noise
by: Chen, Zaiwei, et al.
Published: (2023)

Revisiting Inexact Fixed-Point Iterations for Min-Max Problems: Stochasticity and Structured Nonconvexity
by: Alacaoglu, Ahmet, et al.
Published: (2024)

Gradient Clipping Beyond Vector Norms: A Spectral Approach for Matrix-Valued Parameters
by: Yukhimchuk, Alexander, et al.
Published: (2026)

Stochastic Non-Smooth Convex Optimization with Unbounded Gradients
by: Kovalev, Dmitry
Published: (2026)

Optimal Projection-Free Adaptive SGD for Matrix Optimization
by: Kovalev, Dmitry
Published: (2026)

Advancing the lower bounds: An accelerated, stochastic, second-order method with optimal adaptation to inexactness
by: Agafonov, Artem, et al.
Published: (2023)

Adaptive Regularized Newton Method with Inexact Hessian
by: Shestakov, Aleksandr, et al.
Published: (2025)

Tame Riemannian Stochastic Approximation
by: Aspman, Johannes, et al.
Published: (2023)

Exponential Concentration in Stochastic Approximation
by: Law, Kody, et al.
Published: (2022)

Almost Sure Convergence Rates and Concentration of Stochastic Approximation and Reinforcement Learning with Markovian Noise
by: Qian, Xiaochi, et al.
Published: (2024)

Finite-Time Decoupled Convergence in Nonlinear Two-Time-Scale Stochastic Approximation
by: Han, Yuze, et al.
Published: (2024)

A Privacy Preserving Randomized Gossip Algorithm via Controlled Noise Insertion
by: Hanzely, Filip, et al.
Published: (2019)

Gaussian Approximation and Multiplier Bootstrap for Federated Linear Stochastic Approximation
by: Levin, Ilya, et al.
Published: (2026)

SCAFFLSA: Taming Heterogeneity in Federated Linear Stochastic Approximation and TD Learning
by: Mangold, Paul, et al.
Published: (2024)

Convergence Rate of the Last Iterate of Stochastic Proximal Algorithms
by: Vaidyan, Kevin Kurian Thomas, et al.
Published: (2026)

Revisiting the Last-Iterate Convergence of Stochastic Gradient Methods
by: Liu, Zijian, et al.
Published: (2023)

Efficient Stochastic Approximation of Minimax Excess Risk Optimization
by: Zhang, Lijun, et al.
Published: (2023)

Accelerated Stochastic ExtraGradient: Mixing Hessian and Gradient Similarity to Reduce Communication in Distributed and Federated Learning
by: Bylinkin, Dmitry, et al.
Published: (2024)

Robust Sublinear Convergence Rates for Iterative Bregman Projections
by: Peyré, Gabriel
Published: (2026)

Almost Sure Convergence Rates of Stochastic Approximation and Reinforcement Learning via a Poisson-Moreau Drift
by: Liu, Xinyu, et al.
Published: (2026)

Where Does Warm-Up Come From? Adaptive Scheduling for Norm-Constrained Optimizers
by: Riabinin, Artem, et al.
Published: (2026)

LoFT: Low-Rank Adaptation That Behaves Like Full Fine-Tuning
by: Tastan, Nurbek, et al.
Published: (2025)

Muon with Nesterov Momentum: Heavy-Tailed Noise and (Randomized) Inexact Polar Decomposition
by: Choudhury, Sayantan, et al.
Published: (2026)