On the public citation graph
Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
0 signed · 140 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/cpa.20131openalex-snapshot
For most large underdetermined systems of equations, the minimal 𝓁 1 ‐norm near‐solution approximates the sparsest near‐solution
inferredcites →https://doi.org/10.1002/nav.3800030109openalex-snapshot
An algorithm for quadratic programming
inferredcites →https://doi.org/10.1007/bf01589445openalex-snapshot
Some comments on Wolfe's ‘away step’
inferredcites →https://doi.org/10.1007/s10994-010-5173-zopenalex-snapshot
On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms
inferredcites →https://doi.org/10.1023/a:1022869011914openalex-snapshot
Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm
inferredcites →https://doi.org/10.1080/10556780701589669openalex-snapshot
Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
inferredcites →https://doi.org/10.1109/18.256500openalex-snapshot
Universal approximation bounds for superpositions of a sigmoidal function
inferredcites →https://doi.org/10.1109/18.485715openalex-snapshot
Asymptotic distribution of the errors in scalar and vector quantizers
inferredcites →https://doi.org/10.1109/78.258082openalex-snapshot
Matching pursuits with time-frequency dictionaries
inferredcites →https://doi.org/10.1109/tit.2002.808136openalex-snapshot
Sequential greedy approximation for certain convex optimization problems
inferredcites →https://doi.org/10.1109/tit.2005.858979openalex-snapshot
Decoding by Linear Programming
inferredcites →https://doi.org/10.1111/j.2517-6161.1996.tb02080.xopenalex-snapshot
Regression Shrinkage and Selection Via the Lasso
inferredcites →https://doi.org/10.1137/s0097539792240406openalex-snapshot
Sparse Approximate Solutions to Linear Systems
inferredcites →https://doi.org/10.1145/1824777.1824783openalex-snapshot
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
inferredcites →https://doi.org/10.1214/aos/1013203451openalex-snapshot
Greedy function approximation: A gradient boosting machine.
inferredcites →https://doi.org/10.1214/aos/1024691352openalex-snapshot
Boosting the margin: a new explanation for the effectiveness of voting methods
inferredcites →https://doi.org/10.1214/aos/1176348546openalex-snapshot
A Simple Lemma on Greedy Approximation in Hilbert Space and Convergence Rates for Projection Pursuit Regression and Neural Network Training
inferredcites →https://doi.org/10.1287/ijoc.1080.0315openalex-snapshot
An Algorithm and a Core Set Result for the Weighted Euclidean One-Center Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/asjc.70052openalex-snapshot
A class of algorithms for constrained stochastic convex optimization with sparsity
inferred← citeshttps://doi.org/10.1007/978-3-030-06164-7_11openalex-snapshot
Statistical Computational Learning
inferred← citeshttps://doi.org/10.1007/978-3-030-10928-8_26openalex-snapshot
Online Feature Selection by Adaptive Sub-gradient Methods
inferred← citeshttps://doi.org/10.1007/978-3-030-31654-9_29openalex-snapshot
Quadratic Approximation Greedy Pursuit for Cardinality-Constrained Sparse Learning
inferred← citeshttps://doi.org/10.1007/978-3-031-01926-5_8openalex-snapshot
Nonparametric Estimation of Choice Models
inferred← citeshttps://doi.org/10.1007/978-3-032-06078-5_26openalex-snapshot
Gradient Boosting Versus Mixed Integer Programming for Sparse Additive Modeling
inferred← citeshttps://doi.org/10.1007/978-3-319-01881-2openalex-snapshot
Algorithms for Sparsity-Constrained Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-01881-2_3openalex-snapshot
Sparsity-Constrained Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-19066-2_25openalex-snapshot
Learning Low Cost Multi-target Models by Enforcing Sparsity
inferred← citeshttps://doi.org/10.1007/978-3-319-41945-9_7openalex-snapshot
Sparse Approximation by Greedy Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-24412-4_11openalex-snapshot
Adaptive and Optimal Online Linear Regression on ℓ1-Balls
inferred← citeshttps://doi.org/10.1007/978-3-662-44848-9_26openalex-snapshot
FASOLE: Fast Algorithm for Structured Output LEarning
inferred← citeshttps://doi.org/10.1007/s00034-016-0416-2openalex-snapshot
Data-Driven Forward–Backward Pursuit for Sparse Signal Reconstruction
inferred← citeshttps://doi.org/10.1007/s00365-014-9272-0openalex-snapshot
Greedy Approximation in Convex Optimization
inferred← citeshttps://doi.org/10.1007/s10092-016-0183-2openalex-snapshot
Greedy Strategies for Convex Optimization
inferred← citeshttps://doi.org/10.1007/s10107-014-0839-0openalex-snapshot
Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
inferred← citeshttps://doi.org/10.1007/s10107-023-01975-zopenalex-snapshot
Asymptotic linear convergence of fully-corrective generalized conditional gradient methods
inferred← citeshttps://doi.org/10.1007/s10208-015-9248-xopenalex-snapshot
Convex Optimization on Banach Spaces
inferred← citeshttps://doi.org/10.1007/s10589-016-9871-8openalex-snapshot
Decomposable norm minimization with proximal-gradient homotopy algorithm
inferred← citeshttps://doi.org/10.1007/s10878-022-00914-6openalex-snapshot
Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy
inferred← citeshttps://doi.org/10.1007/s10957-022-02156-2openalex-snapshot
A Greedy Newton-Type Method for Multiple Sparse Constraint Problem
inferred← citeshttps://doi.org/10.1007/s10994-016-5578-4openalex-snapshot
Fast and scalable Lasso via stochastic Frank–Wolfe methods with a convergence guarantee
inferred← citeshttps://doi.org/10.1007/s11063-023-11424-9openalex-snapshot
Zero-Norm ELM with Non-convex Quadratic Loss Function for Sparse and Robust Regression
inferred← citeshttps://doi.org/10.1007/s43670-025-00098-0openalex-snapshot
The greedy side of the LASSO: new algorithms for weighted sparse recovery via loss function-based orthogonal matching pursuit
inferred← citeshttps://doi.org/10.1016/j.acha.2018.10.005openalex-snapshot
Generalized greedy alternatives
inferred← citeshttps://doi.org/10.1016/j.acha.2022.05.001openalex-snapshot
Biorthogonal Greedy Algorithms in convex optimization
inferred← citeshttps://doi.org/10.1016/j.acha.2022.06.002openalex-snapshot
Gradient projection Newton pursuit for sparsity constrained optimization
inferred← citeshttps://doi.org/10.1016/j.cam.2022.114872openalex-snapshot
Gradient projection Newton algorithm for sparse collaborative learning using synthetic and real datasets of applications
inferred← citeshttps://doi.org/10.1016/j.cose.2017.06.013openalex-snapshot
Empirical analysis of cyber-attacks to an indoor real time localization system for autonomous robots
inferred← citeshttps://doi.org/10.1016/j.ijmedinf.2019.104014openalex-snapshot
Cost-effective survival prediction for patients with advanced prostate cancer using clinical trial and real-world hospital registry datasets
inferred← citeshttps://doi.org/10.1016/j.jco.2015.06.005openalex-snapshot
Nonlinear tensor product approximation of functions
inferred← citeshttps://doi.org/10.1016/j.neunet.2021.12.016openalex-snapshot
Fully corrective gradient boosting with squared hinge: Fast learning rates and early stopping
inferred← citeshttps://doi.org/10.1016/j.patcog.2022.108560openalex-snapshot
A globally convergent approximate Newton method for non-convex sparse learning
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.09.024openalex-snapshot
Adaptive and optimal online linear regression on ℓ1 -balls
inferred← citeshttps://doi.org/10.1109/acssc.2011.6190194openalex-snapshot
Greedy sparsity-constrained optimization
inferred← citeshttps://doi.org/10.1109/acssc.2014.7094676openalex-snapshot
Greedy algorithms in convex optimization on Banach spaces
inferred← citeshttps://doi.org/10.1109/cvpr.2014.525openalex-snapshot
Newton Greedy Pursuit: A Quadratic Approximation Method for Sparsity-Constrained Optimization
inferred← citeshttps://doi.org/10.1109/cyber50695.2020.9279124openalex-snapshot
Efficient Super Greedy Boosting for Classification
inferred← citeshttps://doi.org/10.1109/icassp49357.2023.10097231openalex-snapshot
M22: Rate-Distortion Inspired Gradient Compression
inferred← citeshttps://doi.org/10.1109/icc45855.2022.9838754openalex-snapshot
DNN gradient lossless compression: Can GenNorm be the answer?
inferred← citeshttps://doi.org/10.1109/iccv.2019.00504openalex-snapshot
Adaptive Activation Thresholding: Dynamic Routing Type Behavior for Interpretability in Convolutional Neural Networks
inferred← citeshttps://doi.org/10.1109/icdm.2014.117openalex-snapshot
On Sparse Feature Attacks in Adversarial Learning
inferred← citeshttps://doi.org/10.1109/icdm.2014.134openalex-snapshot
Orthogonal Matching Pursuit for Sparse Quantile Regression
inferred← citeshttps://doi.org/10.1109/jiot.2024.3456857openalex-snapshot
Communication-Efficient Federated DNN Training: Convert, Compress, Correct
inferred← citeshttps://doi.org/10.1109/lsp.2022.3149377openalex-snapshot
A Fast and Scalable Polyatomic Frank-Wolfe Algorithm for the LASSO
inferred← citeshttps://doi.org/10.1109/lwc.2019.2933624openalex-snapshot
FCFGS-CV-Based Channel Estimation for Wideband mmWave Massive MIMO Systems With Low-Resolution ADCs
inferred← citeshttps://doi.org/10.1109/ssp49050.2021.9513836openalex-snapshot
Gridless Channel Estimation for mmWave Hybrid Massive MIMO Systems with Low-Resolution ADCs
inferred← citeshttps://doi.org/10.1109/tcomm.2023.3327778openalex-snapshot
M22: A Communication-Efficient Algorithm for Federated Learning Inspired by Rate-Distortion
inferred← citeshttps://doi.org/10.1109/tit.2011.2162263openalex-snapshot
Sparse Recovery With Orthogonal Matching Pursuit Under RIP
inferred← citeshttps://doi.org/10.1109/tit.2017.2749330openalex-snapshot
Linear Convergence of Stochastic Iterative Greedy Algorithms With Sparse Constraints
inferred← citeshttps://doi.org/10.1109/tit.2018.2805903openalex-snapshot
Bayesian Model Averaging With Exponentiated Least Squares Loss
inferred← citeshttps://doi.org/10.1109/tit.2019.2894519openalex-snapshot
Minimum-Entropy Couplings and Their Applications
inferred← citeshttps://doi.org/10.1109/tit.2022.3161620openalex-snapshot
vqSGD: Vector Quantized Stochastic Gradient Descent
inferred← citeshttps://doi.org/10.1109/tkde.2018.2790928openalex-snapshot
Sparse Feature Attacks in Adversarial Learning
inferred← citeshttps://doi.org/10.1109/tnnls.2016.2600243openalex-snapshot
Greedy Methods, Randomization Approaches, and Multiarm Bandit Algorithms for Efficient Sparsity-Constrained Optimization
inferred← citeshttps://doi.org/10.1109/tnnls.2018.2877433openalex-snapshot
Tracking Sparse Linear Classifiers
inferred← citeshttps://doi.org/10.1109/tnnls.2021.3087805openalex-snapshot
Efficient Gradient Support Pursuit With Less Hard Thresholding for Cardinality-Constrained Learning
inferred← citeshttps://doi.org/10.1109/tpami.2013.159openalex-snapshot
Learning Nonlinear Functions Using Regularized Greedy Forest
inferred← citeshttps://doi.org/10.1109/tpami.2013.85openalex-snapshot
Forward Basis Selection for Pursuing Sparse Representations over a Dictionary
inferred← citeshttps://doi.org/10.1109/tpami.2017.2651813openalex-snapshot
Newton-Type Greedy Selection Methods for $\ell _0$ -Constrained Minimization
inferred← citeshttps://doi.org/10.1109/tsp.2014.2385036openalex-snapshot
Matching Pursuit LASSO Part I: Sparse Recovery Over Big Dictionary
inferred← citeshttps://doi.org/10.1109/twc.2021.3054998openalex-snapshot
Spatial Wideband Channel Estimation for mmWave Massive MIMO Systems With Hybrid Architectures and Low-Resolution ADCs
inferred← citeshttps://doi.org/10.1109/wcsp.2013.6677186openalex-snapshot
Sparse equalizer design under a quadratic constraint
inferred← citeshttps://doi.org/10.1134/s0081543814010180openalex-snapshot
Greedy expansions in convex optimization
inferred← citeshttps://doi.org/10.1134/s0081543816040222openalex-snapshot
Convergence and rate of convergence of some greedy algorithms in convex optimization
inferred← citeshttps://doi.org/10.1137/1.9781611974010.54openalex-snapshot
A Distributed Frank-Wolfe Algorithm for Communication-Efficient Sparse Learning
inferred← citeshttps://doi.org/10.1145/1553374.1553493openalex-snapshot
Stochastic methods for l 1 regularized loss minimization
inferred← citeshttps://doi.org/10.1145/2488388.2488391openalex-snapshot
Multi-label learning with millions of labels
inferred← citeshttps://doi.org/10.1145/2517288.2517294openalex-snapshot
Feature engineering and tree modeling for author-paper identification challenge
inferred← citeshttps://doi.org/10.1145/3097983.3098165openalex-snapshot
Fast Newton Hard Thresholding Pursuit for Sparsity Constrained Nonconvex Optimization
inferred← citeshttps://doi.org/10.1201/b17558-6openalex-snapshot
Hybrid Conditional Gradient-Smoothing Algorithms with Applications to Sparse and Low Rank Regularization
inferred← citeshttps://doi.org/10.1214/12-aos1025openalex-snapshot
Deviation optimal learning using greedy $Q$-aggregation
inferred← citeshttps://doi.org/10.1214/12-sts394openalex-snapshot
Structured Sparsity through Convex Optimization
inferred← citeshttps://doi.org/10.1287/mnsc.2019.3373openalex-snapshot
A Conditional Gradient Approach for Nonparametric Estimation of Mixing Distributions
inferred← citeshttps://doi.org/10.1360/n112016-00045openalex-snapshot
Decomposition-based Pareto optimization for subset selection
inferred← citeshttps://doi.org/10.1561/978-1-63828-477-220251009openalex-snapshot
Private Optimization
inferred← citeshttps://doi.org/10.1609/aaai.v31i1.10900openalex-snapshot
A Two-Stage Approach for Learning a Sparse Model with Sharp Excess Risk Analysis
inferred← citeshttps://doi.org/10.17760/d20410362openalex-snapshot
Leveraging structural properties for large-scale optimization
inferred← citeshttps://doi.org/10.23919/wiopt.2018.8362816openalex-snapshot
Uncoded placement optimization for coded delivery
inferred← citeshttps://doi.org/10.3390/math11112559openalex-snapshot
On the Rate of Convergence of Greedy Algorithms
inferred← citeshttps://doi.org/10.3929/ethz-a-007050453openalex-snapshot
Sparse Convex Optimization Methods for Machine Learning
inferred← citeshttps://doi.org/10.3929/ethz-b-000474164openalex-snapshot
Enforcing and Discovering Structure in Machine Learning
inferred← citeshttps://doi.org/10.4213/rm10186openalex-snapshot
On greedy approximation in complex Banach spaces
inferred← citeshttps://doi.org/10.4213/rm10186eopenalex-snapshot
On greedy approximation in complex Banach spaces
inferred← citeshttps://doi.org/10.4213/rm10245openalex-snapshot
Brief introduction in greedy approximation
inferred← citeshttps://doi.org/10.4213/rm10245eopenalex-snapshot
Brief introduction in greedy approximation
inferred← citeshttps://doi.org/10.48550/arxiv.1009.3896openalex-snapshot
Optimistic Rates for Learning with a Smooth Loss
inferred← citeshttps://doi.org/10.48550/arxiv.1105.4042openalex-snapshot
Adaptive and optimal online linear regression on $\ell^1$-balls
inferred← citeshttps://doi.org/10.48550/arxiv.1106.1622openalex-snapshot
Large-Scale Convex Minimization with a Low-Rank Constraint
inferred← citeshttps://doi.org/10.48550/arxiv.1106.2774openalex-snapshot
Orthogonal Matching Pursuit with Replacement
inferred← citeshttps://doi.org/10.48550/arxiv.1108.1170openalex-snapshot
Convex Optimization without Projection Steps
inferred← citeshttps://doi.org/10.48550/arxiv.1109.0820openalex-snapshot
ShareBoost: Efficient Multiclass Learning with Feature Sharing
inferred← citeshttps://doi.org/10.48550/arxiv.1203.5483openalex-snapshot
Greedy Sparsity-Constrained Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1206.2372openalex-snapshot
PRISMA: PRoximal Iterative SMoothing Algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.1207.4747openalex-snapshot
Block-Coordinate Frank-Wolfe Optimization for Structural SVMs
inferred← citeshttps://doi.org/10.48550/arxiv.1210.5840openalex-snapshot
Supervised Learning with Similarity Functions
inferred← citeshttps://doi.org/10.48550/arxiv.1302.0315openalex-snapshot
Sparse Multiple Kernel Learning with Geometric Convergence Rate
inferred← citeshttps://doi.org/10.48550/arxiv.1308.6504openalex-snapshot
On the Conditions of Sparse Parameter Estimation via Log-Sum Penalty Regularization
inferred← citeshttps://doi.org/10.48550/arxiv.1311.5750openalex-snapshot
Gradient Hard Thresholding Pursuit for Sparsity-Constrained Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1312.1244openalex-snapshot
Chebushev Greedy Algorithm in convex optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1401.0086openalex-snapshot
Forward-Backward Greedy Algorithms for General Convex Smooth Functions over A Cardinality Constraint
inferred← citeshttps://doi.org/10.48550/arxiv.1402.4624openalex-snapshot
Sparse Quantile Huber Regression for Efficient and Robust Estimation
inferred← citeshttps://doi.org/10.48550/arxiv.1410.4828openalex-snapshot
Generalized Conditional Gradient for Sparse Estimation
inferred← citeshttps://doi.org/10.48550/arxiv.1410.5137openalex-snapshot
On Iterative Hard Thresholding Methods for High-dimensional M-Estimation
inferred← citeshttps://doi.org/10.48550/arxiv.1411.5417openalex-snapshot
Private Empirical Risk Minimization Beyond the Worst Case: The Effect of the Constraint Set Geometry
inferred← citeshttps://doi.org/10.48550/arxiv.1412.4182openalex-snapshot
The Statistics of Streaming Sparse Regression
inferred← citeshttps://doi.org/10.48550/arxiv.1501.01689openalex-snapshot
Sparse Solutions to Nonnegative Linear Systems and Applications
inferred← citeshttps://doi.org/10.48550/arxiv.1510.02558openalex-snapshot
Functional Frank-Wolfe Boosting for General Loss Functions
inferred← citeshttps://doi.org/10.48550/arxiv.1603.02185openalex-snapshot
Distributed Multi-Task Learning with Shared Representation
inferred← citeshttps://doi.org/10.48550/arxiv.1607.08012openalex-snapshot
Learning of Generalized Low-Rank Models: A Greedy Approach
inferred← citeshttps://doi.org/10.48550/arxiv.1710.10551openalex-snapshot
Stochastic Zeroth-order Optimization in High Dimensions
inferred← citeshttps://doi.org/10.48550/arxiv.1805.11251openalex-snapshot
On Maximization of Weakly Modular Functions: Guarantees of Multi-stage Algorithms, Tractability, and Hardness
inferred← citeshttps://doi.org/10.48550/arxiv.1901.02763openalex-snapshot
Global and Quadratic Convergence of Newton Hard-Thresholding Pursuit
inferred← citeshttps://doi.org/10.48550/arxiv.1905.12091openalex-snapshot
Approximate Guarantees for Dictionary Learning
inferred← citeshttps://doi.org/10.48550/arxiv.1912.00858openalex-snapshot
Efficient Relaxed Gradient Support Pursuit for Sparsity Constrained Non-convex Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.2007.00715openalex-snapshot
Bayesian Coresets: Revisiting the Nonconvex Optimization Perspective
inferred← citeshttps://doi.org/10.48550/arxiv.2101.06262openalex-snapshot
Local Search Algorithms for Rank-Constrained Convex Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.2108.10131openalex-snapshot
Improving the trustworthiness of image classification models by utilizing bounding-box annotations
inferred← citeshttps://doi.org/10.5555/2567709.2502607openalex-snapshot
Greedy sparsity-constrained optimization
inferred← citeshttps://doi.org/10.70675/09f62edcze480z4804z8c06z74acbebcf3b4openalex-snapshot
A study of some trade-offs in statistical learning : online learning, generative models and fairness
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.