No article text was recorded for this version.
second-order sparsity exploitation
Version 1 of 1162 papers247 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Newton Greedy Pursuit: A Quadratic Approximation Method for Sparsity-Constrained Optimization
- Blog: Accelerating Sinkhorn Algorithm with Sparse Newton Iterations
- Blog: Fast algorithms for sparse principal component analysis based on Rayleigh quotient iteration
- Blog: On Efficiently Solving the Subproblems of a Level-Set Method for Fused Lasso Problems
- Blog: Safe and Sparse Newton Method for Entropic-Regularized Optimal Transport
- Blog: The Iterative Optimal Brain Surgeon: Faster Sparse Recovery by Leveraging Second-Order Information
- Blog: A Computationally Efficient Sparsified Online Newton Method
- Blog: Beyond Pham's algorithm for joint diagonalization
- Blog: On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope
- Blog: An Efficient Semi-smooth Newton Augmented Lagrangian Method for Elastic Net
- Blog: The Sparse-Plus-Low-Rank Quasi-Newton Method for Entropic-Regularized Optimal Transport
- Blog: A Sinkhorn-type Algorithm for Constrained Optimal Transport
- Blog: Beyond Pham's algorithm for joint diagonalization
- Blog: SGN: Sparse Gauss-Newton for Accelerated Sensitivity Analysis
- Blog: Iterative Scaled Trust-Region Learning in Krylov Subspaces via Pearlmutter's Implicit Sparse Hessian-Vector Multiply
- Blog: Importance Sparsification for Sinkhorn Algorithm
- Blog: Accelerating Sinkhorn algorithm with sparse Newton iterations
- Blog: Efficient sparse Hessian based algorithms for the clustered lasso problem
- Blog: An Efficient Semismooth Newton Based Algorithm for Convex Clustering
- Blog: On Quadratic Convergence of DC Proximal Newton Algorithm for Nonconvex Sparse Learning in High Dimensions
- Blog: Much Faster Algorithms for Matrix Scaling
- Blog: Model-based hand tracking with texture, shading and self-occlusions
- Blog: An Efficient Augmented Lagrangian-Based Method for Linear Equality-Constrained Lasso
- Blog: A Corrected Inexact Proximal Augmented Lagrangian Method with a Relative Error Criterion for a Class of Group-quadratic Regularized Optimal Transport Problems
- Blog: Interior Point Implementations of Alternating Minimization Training
- Blog: A Fast and Provable Algorithm for Sparse Phase Retrieval
- Blog: On Efficient and Scalable Computation of the Nonparametric Maximum Likelihood Estimator in Mixture Models
- Blog: Efficient Sparse Semismooth Newton Methods for the Clustered Lasso Problem
- Blog: Second-Order Stochastic Optimization for Machine Learning in Linear Time
- Blog: Sampling with Riemannian Hamiltonian Monte Carlo in a Constrained Space
- Blog: PINS: Proximal Iterations with Sparse Newton and Sinkhorn for Optimal Transport
- Blog: Faster Independent Component Analysis by Preconditioning With Hessian Approximations
- Blog: An efficient algorithm for entropic optimal transport under martingale-type constraints
- Blog: Super-Linear Convergence of Dual Augmented-Lagrangian Algorithm for Sparsity Regularized Estimation
- Blog: Much Faster Algorithms for Matrix Scaling
- Blog: A highly efficient semismooth Newton augmented Lagrangian method for solving Lasso problems
- Blog: A Fast and Provable Algorithm for Sparse Phase Retrieval
- Blog: The Hypervolume Indicator Hessian Matrix: Analytical Expression, Computational Time Complexity, and Sparsity
- Blog: Matrix-free Second-order Optimization of Gaussian Splats with Residual Sampling
- Blog: Computations of optimal transport distance with Fisher information regularization
- Blog: The Hessian Screening Rule
- Blog: Efficient inference for time-varying behavior during learning
- Blog: A Penalty Approach For Differentiation Through Black-box Quadratic Programming Solvers
- Blog: Two-Grid Preconditioned Solver for Bundle Adjustment
- Blog: A Fast Algorithm for Joint Diagonalization with Non-orthogonal Transformations and its Application to Blind Source Separation
- Blog: Constructing a variational family for nonlinear state-space models
- Blog: An approach for finding fully Bayesian optimal designs using normal-based approximations to loss functions
- Blog: Event-Based Mosaicing Bundle Adjustment
- Blog: A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems
- Blog: Approximate Vanishing Ideal Computations at Scale
- Blog: The Hypervolume Indicator Hessian Matrix: Analytical Expression, Computational Time Complexity, and Sparsity
- Blog: SchurVINS: Schur Complement-Based Lightweight Visual Inertial Navigation System
- Blog: A highly efficient algorithm for solving exclusive lasso problems
- Blog: The Iterative Optimal Brain Surgeon: Faster Sparse Recovery by Leveraging Second-Order Information
- Blog: Sparse Inverse Covariance Matrix Estimation Using Quadratic Approximation
- Blog: An Efficient Semismooth Newton Based Algorithm for Convex Clustering
- Blog: New Proximal Newton-Type Methods for Convex Optimization
- Blog: The Hypervolume Indicator Hessian Matrix: Analytical Expression, Computational Time Complexity, and Sparsity
- Blog: Speeding-up one-versus-all training for extreme classification via mean-separating initialization
- Blog: 3DGS2: Near Second-order Converging 3D Gaussian Splatting
Showing 60 of 162 papers.
History & citation
Current · Permanent link
- Exploiting Second-Order Sparsity for Fast Sparse Estimation merged into this direction (70% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_second_order_sparsity_exploitation_8e5166cf,
title = {second-order sparsity exploitation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/second-order-sparsity-exploitation/rdr_8e5166cf8e4748639731d3dff2de7a90},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_second_order_sparsity_exploitation_8e5166cf_v1,
title = {second-order sparsity exploitation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/second-order-sparsity-exploitation/rdr_8e5166cf8e4748639731d3dff2de7a90/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}