Image de couverture de livre

An Asymptotically Optimal Coordinate Descent Algorithm for Learning Bayesian Networks from Gaussian Models

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Xu, Tong, Küçükyavuz, Simge, Shojaie, Ali, Taeb, Armeen
Format:	Preprint
Publié:	2024
Sujets:	Machine Learning 65K10, 68T20, 68Q25
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Convergence of Momentum-Based Optimization Algorithms with Time-Varying Parameters
par: Vidyasagar, Mathukumalli
Publié: (2025)

Generalized sparsity-promoting solvers for Bayesian inverse problems: Versatile sparsifying transforms and unknown noise variances
par: Lindbloom, Jonathan, et autres
Publié: (2024)

An adaptive framework for first-order gradient methods
par: Hu, Xiaozhe, et autres
Publié: (2026)

A fast algorithm for Stallings foldings over virtually free groups
par: Cookson, Sam, et autres
Publié: (2023)

Stochastic Mirror Descent for Convex Optimization with Consensus Constraints
par: Borovykh, Anastasia, et autres
Publié: (2022)

Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption
par: Cai, HanQin, et autres
Publié: (2023)

On Maximum-a-Posteriori estimation with Plug & Play priors and stochastic gradient descent
par: Laumont, Rémi, et autres
Publié: (2022)

Sampling Strategies in Bayesian Inversion: A Study of RTO and Langevin Methods
par: Laumont, Remi, et autres
Publié: (2024)

Hybrid hierarchical matrices with adaptive mixed precision storage
par: Khan, Ritesh, et autres
Publié: (2026)

A Symplectic Discretization Based Proximal Point Algorithm for Convex Minimization
par: Yuan, Ya-xiang, et autres
Publié: (2024)

Deterministic computation of quantiles in a Lipschitz framework
par: Gu, Yurun, et autres
Publié: (2024)

A Proximal-Gradient Method for Solving Regularized Optimization Problems with General Constraints
par: Curtis, Frank E., et autres
Publié: (2025)

A Proximal-Gradient Method for Constrained Optimization
par: Dai, Yutong, et autres
Publié: (2024)

Randomized Matrix Sketching for Neural Network Training and Gradient Monitoring
par: Antil, Harbir, et autres
Publié: (2025)

Polynomial algorithm for alternating link equivalence
par: Haider, Touseef, et autres
Publié: (2024)

Reinterpreting EMML as Mirror Descent for Constrained Maximum Likelihood Estimation
par: Clerc, Antonin, et autres
Publié: (2026)

The average-case complexity of the Word Problem for groups of matrices over $\mathbb{Z}$ is linear
par: Bassino, Frédérique, et autres
Publié: (2025)

Superfast 1-Norm Estimation
par: Go, Soo, et autres
Publié: (2025)

Approximation of Splines in Wasserstein Spaces
par: Justiniano, Jorge, et autres
Publié: (2023)

Shape Gradient Based Non-Parametric Mumford-Shah Segmentation Without Level Sets
par: P, Shafeequdheen, et autres
Publié: (2025)

A Random Integration Algorithm for High-dimensional Function Spaces
par: Chen, Liang, et autres
Publié: (2024)

Regenerative Ulam-von Neumann Algorithm: An Innovative Markov chain Monte Carlo Method for Matrix Inversion
par: Ghosh, Soumyadip, et autres
Publié: (2024)

A polynomial-time algorithm for deciding the Hilbert Nullstellensatz over $\mathbb{Z}_2$. A proof of $\mathbf{P}=\mathbf{NP}$ hypothesis
par: Petrov, Petar P.
Publié: (2022)

A Note on Randomized Kaczmarz Algorithm for Solving Doubly-Noisy Linear Systems
par: Bergou, El Houcine, et autres
Publié: (2023)

Exploratory Analysis of Cyberattack Patterns on E-Commerce Platforms Using Statistical Methods
par: Adeniya, Fatimo Adenike
Publié: (2025)

On the Parenthesisations of Matrix Chains: All are Useful, Few Are Essential
par: López, Francisco, et autres
Publié: (2023)

Integer Programming for Learning Directed Acyclic Graphs from Non-identifiable Gaussian Models
par: Xu, Tong, et autres
Publié: (2024)

Robust First and Second-Order Differentiation for Regularized Optimal Transport
par: Li, Xingjie, et autres
Publié: (2024)

The rate of convergence of Bregman proximal methods: Local geometry vs. regularity vs. sharpness
par: Azizian, Waïss, et autres
Publié: (2022)

Oracle-Net for nonlinear compressed sensing in Electrical Impedance Tomography reconstruction problems
par: Lazzaro, Damiana, et autres
Publié: (2024)

Swarm Intelligence-Driven Client Selection for Federated Learning in Cybersecurity applications
par: Khan, Koffka, et autres
Publié: (2024)

Bayesian imaging using Plug & Play priors: when Langevin meets Tweedie
par: Laumont, Rémi, et autres
Publié: (2021)

The complexity of accurate floating point computation
par: Demmel, James
Publié: (2003)

Explicit Construction of Approximate Kolmogorov Superpositions with C2 Smoothness
par: Song, Lunji, et autres
Publié: (2025)

Fast Algorithms for the Computation of the Minimum Distance of a Random Linear Code
par: Hernando, Fernando, et autres
Publié: (2016)

Optimization in Theory and Practice
par: Wright, Stephen J.
Publié: (2025)

Recovering WPA-3 Network Password by Bypassing the Simultaneous Authentication of Equals Handshake using Social Engineering Captive Portal
par: Chadee, Kyle, et autres
Publié: (2024)

The complexity of pinning simple multiloops
par: Seo, Eric, et autres
Publié: (2026)

Fixed-Point Neural Optimal Transport without Implicit Differentiation
par: Park, Yesom, et autres
Publié: (2026)

Fibonacci-Driven Recursive Ensembles: Algorithms, Convergence, and Learning Dynamics
par: Fokoué, Ernest
Publié: (2026)