{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/sparse-learning/papers/2","list_of":"/task/sparse-learning","task":"Sparse Learning","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":2,"rows_per_page":100,"rows":[101,185],"of":185,"counts":{"archive_papers_tagged":185,"with_a_code_link":52,"where_syntology_ran_a_sample":12,"not_listed_spam_title":0,"listed":185,"listed_where_code_ran":12,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":11,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":11,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/sparse-learning","prev":"/task/sparse-learning","next":null,"papers":[{"url":null,"slug":"robust-data-driven-discovery-of-partial","title":"Bayesian data-driven discovery of partial differential equations with variable coefficients","date":"2021-02-02","arxiv_id":"2102.01432","repositories_listed":0,"syntology":null},{"url":null,"slug":"federated-nonconvex-sparse-learning","title":"Federated Nonconvex Sparse Learning","date":"2020-12-31","arxiv_id":"2101.00052","repositories_listed":0,"syntology":null},{"url":null,"slug":"inference-post-selection-of-group-sparse","title":"Approximate Post-Selective Inference for Regression with the Group LASSO","date":"2020-12-31","arxiv_id":"2012.15664","repositories_listed":0,"syntology":null},{"url":null,"slug":"effective-proximal-methods-for-non-convex-non","title":"Effective Proximal Methods for Non-convex Non-smooth Regularized Learning","date":"2020-09-14","arxiv_id":"2009.06562","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-support-driven-bayesian-reweighted","title":"Adaptive support driven Bayesian reweighted algorithm for sparse signal recovery","date":"2020-08-10","arxiv_id":"2008.03877","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-sparse-learning-with-preconditioned","title":"Bayesian Sparse learning with preconditioned stochastic gradient MCMC and its applications","date":"2020-06-29","arxiv_id":"2006.16376","repositories_listed":0,"syntology":null},{"url":null,"slug":"swag-a-wrapper-method-for-sparse-learning","title":"SWAG: A Wrapper Method for Sparse Learning","date":"2020-06-23","arxiv_id":"2006.12837","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-learning-with-cart","title":"Sparse learning with CART","date":"2020-06-07","arxiv_id":"2006.04266","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-sparse-learning-approach-to-the-design-of","title":"A Sparse Learning Approach to the Design of Radar Tunable Architectures with Enhanced Selectivity Properties","date":"2020-04-27","arxiv_id":"2004.13164","repositories_listed":0,"syntology":null},{"url":null,"slug":"classification-of-the-chinese-handwritten","title":"Classification of Chinese Handwritten Numbers with Labeled Projective Dictionary Pair Learning","date":"2020-03-26","arxiv_id":"2003.11700","repositories_listed":0,"syntology":null},{"url":"/paper/adaptive-neural-connections-for-sparsity","slug":"adaptive-neural-connections-for-sparsity","title":"Adaptive Neural Connections for Sparsity Learning","date":"2020-03-05","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-high-order-feature-interactions-with","title":"Learning High Order Feature Interactions with Fine Control Kernels","date":"2020-02-09","arxiv_id":"2002.03298","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-newton-screening","title":"On Newton Screening","date":"2020-01-27","arxiv_id":"2001.10616","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-stochastic-and-online-learning-with","title":"Optimal Stochastic and Online Learning with Individual Iterates","date":"2019-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sdgm-sparse-bayesian-classifier-based-on-a","title":"A Discriminative Gaussian Mixture Model with Sparsity","date":"2019-11-14","arxiv_id":"1911.06028","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-cluster-structured-sparsity-by-1","title":"Learning Cluster Structured Sparsity by Reweighting","date":"2019-10-11","arxiv_id":"1910.05303","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-knowledge-transfer-framework-for","title":"A Knowledge Transfer Framework for Differentially Private Sparse Learning","date":"2019-09-13","arxiv_id":"1909.06322","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-noise-robust-fast-sparse-bayesian-learning","title":"A Bayesian Lasso based Sparse Learning Model","date":"2019-08-20","arxiv_id":"1908.07220","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-unified-approach-to-mixed-integer","title":"A unified approach to mixed-integer optimization problems with logical constraints","date":"2019-07-03","arxiv_id":"1907.02109","repositories_listed":0,"syntology":null},{"url":null,"slug":"forgenet-a-graph-deep-neural-network-model","title":"forgeNet: A graph deep neural network model using tree-based ensemble classifiers for feature extraction","date":"2019-05-23","arxiv_id":"1905.09889","repositories_listed":0,"syntology":null},{"url":null,"slug":"concise-fuzzy-system-modeling-integrating","title":"Concise Fuzzy System Modeling Integrating Soft Subspace Clustering and Sparse Learning","date":"2019-04-24","arxiv_id":"1904.10683","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-learning-for-variable-selection-with","title":"Sparse Learning for Variable Selection with Structures and Nonlinearities","date":"2019-03-26","arxiv_id":"1903.10978","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-learning-in-reproducing-kernel-hilbert","title":"Structure learning via unstructured kernel-based M-regression","date":"2019-01-03","arxiv_id":"1901.00615","repositories_listed":0,"syntology":null},{"url":null,"slug":"proximal-scope-for-distributed-sparse-1","title":"Proximal SCOPE for Distributed Sparse Learning","date":"2018-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"dantzig-selector-with-an-approximately","title":"Dantzig Selector with an Approximately Optimal Denoising Matrix and its Application to Reinforcement Learning","date":"2018-11-02","arxiv_id":"1811.00958","repositories_listed":0,"syntology":null},{"url":null,"slug":"implicit-discourse-relation-recognition-using","title":"Implicit Discourse Relation Recognition using Neural Tensor Network with Interactive Attention and Sparse Learning","date":"2018-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-range-constrained-learning-and-its","title":"Sparse Range-constrained Learning and Its Application for Medical Image Grading","date":"2018-07-11","arxiv_id":"1807.10571","repositories_listed":0,"syntology":null},{"url":null,"slug":"safe-active-feature-selection-for-sparse","title":"Safe Active Feature Selection for Sparse Learning","date":"2018-06-15","arxiv_id":"1806.05817","repositories_listed":0,"syntology":null},{"url":null,"slug":"safe-element-screening-for-submodular","title":"Safe Element Screening for Submodular Function Minimization","date":"2018-05-22","arxiv_id":"1805.08527","repositories_listed":0,"syntology":null},{"url":null,"slug":"structure-preserving-guided-retinal-image","title":"Structure-preserving Guided Retinal Image Filtering and Its Application for Optic Disc Analysis","date":"2018-05-17","arxiv_id":"1805.06625","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-on-hypergraphs-with-sparsity","title":"Learning on Hypergraphs with Sparsity","date":"2018-04-03","arxiv_id":"1804.00836","repositories_listed":0,"syntology":null},{"url":null,"slug":"locally-convex-sparse-learning-over-networks","title":"Locally Convex Sparse Learning over Networks","date":"2018-03-31","arxiv_id":"1804.00130","repositories_listed":0,"syntology":null},{"url":null,"slug":"proximal-scope-for-distributed-sparse","title":"Proximal SCOPE for Distributed Sparse Learning: Better Data Partition Implies Faster Convergence Rate","date":"2018-03-15","arxiv_id":"1803.05621","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-graph-embedded-deep-feedforward-network-for","title":"A graph-embedded deep feedforward network for disease outcome classification and feature selection using gene expression data","date":"2018-01-18","arxiv_id":"1801.06202","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-autoencoder-based-unsupervised-feature","title":"Graph Autoencoder-Based Unsupervised Feature Selection with Broad and Local Data Structure Preservation","date":"2018-01-07","arxiv_id":"1801.02251","repositories_listed":0,"syntology":null},{"url":null,"slug":"strongly-hierarchical-factorization-machines","title":"Strongly Hierarchical Factorization Machines and ANOVA Kernel Regression","date":"2017-12-25","arxiv_id":"1712.09133","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-new-data-driven-sparse-learning-approach-to","title":"A New Data-Driven Sparse-Learning Approach to Study Chemical Reaction Networks","date":"2017-12-18","arxiv_id":"1712.06281","repositories_listed":0,"syntology":null},{"url":null,"slug":"super-sparse-learning-in-similarity-spaces","title":"Super-sparse Learning in Similarity Spaces","date":"2017-12-17","arxiv_id":"1712.06131","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-data-driven-sparse-learning-approach-to","title":"A Data-Driven Sparse-Learning Approach to Model Reduction in Chemical Reaction Networks","date":"2017-12-12","arxiv_id":"1712.04493","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-quadratic-convergence-of-dc-proximal","title":"On Quadratic Convergence of DC Proximal Newton Algorithm in Nonconvex Sparse Learning","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"parametric-simplex-method-for-sparse-learning","title":"Parametric Simplex Method for Sparse Learning","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"nonsparse-learning-with-latent-variables","title":"Nonsparse learning with latent variables","date":"2017-10-07","arxiv_id":"1710.02704","repositories_listed":0,"syntology":null},{"url":null,"slug":"communication-efficient-algorithm-for","title":"Communication-efficient Algorithm for Distributed Sparse Learning via Two-way Truncation","date":"2017-09-02","arxiv_id":"1709.00537","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-quadratic-convergence-of-dc-proximal-1","title":"On Quadratic Convergence of DC Proximal Newton Algorithm for Nonconvex Sparse Learning in High Dimensions","date":"2017-06-19","arxiv_id":"1706.06066","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatically-redundant-features-removal-for","title":"Automatically Redundant Features Removal for Unsupervised Feature Selection via Sparse Feature Graph","date":"2017-05-13","arxiv_id":"1705.04804","repositories_listed":0,"syntology":null},{"url":null,"slug":"homotopy-parametric-simplex-method-for-sparse","title":"Homotopy Parametric Simplex Method for Sparse Learning","date":"2017-04-04","arxiv_id":"1704.01079","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-projection-operator-to-a-three-view","title":"On The Projection Operator to A Three-view Cardinality Constrained Set","date":"2017-03-21","arxiv_id":"1703.07345","repositories_listed":0,"syntology":null},{"url":null,"slug":"decentralized-frank-wolfe-algorithm-for","title":"Decentralized Frank-Wolfe Algorithm for Convex and Non-convex Problems","date":"2016-12-05","arxiv_id":"1612.01216","repositories_listed":0,"syntology":null},{"url":null,"slug":"simultaneous-clustering-and-estimation-of","title":"Simultaneous Clustering and Estimation of Heterogeneous Graphical Models","date":"2016-11-28","arxiv_id":"1611.09391","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-learning-with-nonconvex-l1-2","title":"Fast Learning with Nonconvex L1-2 Regularization","date":"2016-10-29","arxiv_id":"1610.09461","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-unsupervised-multi-view-feature","title":"Online Unsupervised Multi-view Feature Selection","date":"2016-09-27","arxiv_id":"1609.08286","repositories_listed":0,"syntology":null},{"url":null,"slug":"local-region-sparse-learning-for-image-on","title":"Local Region Sparse Learning for Image-on-Scalar Regression","date":"2016-05-27","arxiv_id":"1605.08501","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-distributed-learning-with-sparsity","title":"Efficient Distributed Learning with Sparsity","date":"2016-05-25","arxiv_id":"1605.07991","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonconvex-sparse-learning-via-stochastic","title":"Nonconvex Sparse Learning via Stochastic Optimization with Progressive Variance Reduction","date":"2016-05-09","arxiv_id":"1605.02711","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-exact-recovery-of-sparse-signals-via","title":"On the exact recovery of sparse signals via conic relaxations","date":"2016-03-15","arxiv_id":"1603.04572","repositories_listed":0,"syntology":null},{"url":null,"slug":"universal-collaboration-strategies-for-signal","title":"Universal Collaboration Strategies for Signal Detection: A Sparse Learning Approach","date":"2016-01-22","arxiv_id":"1601.06201","repositories_listed":0,"syntology":null},{"url":null,"slug":"honor-hybrid-optimization-for-non-convex","title":"HONOR: Hybrid Optimization for NOn-convex Regularized problems","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-learning-of-maximum-likelihood-model","title":"Sparse learning of maximum likelihood model for optimization of complex loss function","date":"2015-11-18","arxiv_id":"1511.05743","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-learning-for-large-scale-and-high","title":"Sparse Learning for Large-scale and High-dimensional Data: A Randomized Convex-concave Optimization Approach","date":"2015-11-12","arxiv_id":"1511.03766","repositories_listed":0,"syntology":null},{"url":null,"slug":"parametric-maxflows-for-structured-sparse","title":"Parametric Maxflows for Structured Sparse Learning with Convex Relaxations of Submodular Functions","date":"2015-09-14","arxiv_id":"1509.03946","repositories_listed":0,"syntology":null},{"url":null,"slug":"best-subset-selection-via-a-modern","title":"Best Subset Selection via a Modern Optimization Lens","date":"2015-07-11","arxiv_id":"1507.03133","repositories_listed":0,"syntology":null},{"url":null,"slug":"safe-feature-pruning-for-sparse-high-order","title":"Safe Feature Pruning for Sparse High-Order Interaction Models","date":"2015-06-26","arxiv_id":"1506.08002","repositories_listed":0,"syntology":null},{"url":null,"slug":"direct-l_2p-norm-learning-for-feature","title":"Direct l_(2,p)-Norm Learning for Feature Selection","date":"2015-04-02","arxiv_id":"1504.00430","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-nonconvex-approach-for-structured-sparse","title":"A Nonconvex Approach for Structured Sparse Learning","date":"2015-03-07","arxiv_id":"1503.02164","repositories_listed":0,"syntology":null},{"url":null,"slug":"statistical-limits-of-convex-relaxations","title":"Statistical Limits of Convex Relaxations","date":"2015-03-04","arxiv_id":"1503.01442","repositories_listed":0,"syntology":null},{"url":null,"slug":"pathwise-coordinate-optimization-for-sparse","title":"Pathwise Coordinate Optimization for Sparse Learning: Algorithm and Theory","date":"2014-12-23","arxiv_id":"1412.7477","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerated-mini-batch-randomized-block","title":"Accelerated Mini-batch Randomized Block Coordinate Descent Method","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"partial-occlusion-handling-for-visual","title":"Partial Occlusion Handling for Visual Tracking via Robust Part Matching","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-distributed-frank-wolfe-algorithm-for","title":"A Distributed Frank-Wolfe Algorithm for Communication-Efficient Sparse Learning","date":"2014-04-09","arxiv_id":"1404.2644","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-l2-loss-functions-for-learning-sparse","title":"Beyond L2-Loss Functions for Learning Sparse Models","date":"2014-03-26","arxiv_id":"1403.6706","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-learning-over-infinite-subgraph","title":"Sparse Learning over Infinite Subgraph Features","date":"2014-03-20","arxiv_id":"1403.5177","repositories_listed":0,"syntology":null},{"url":null,"slug":"can-image-level-labels-replace-pixel-level","title":"Can Image-Level Labels Replace Pixel-Level Labels for Image Parsing","date":"2014-03-07","arxiv_id":"1403.1626","repositories_listed":0,"syntology":null},{"url":null,"slug":"tensor-representation-and-manifold-learning","title":"Tensor Representation and Manifold Learning Methods for Remote Sensing Images","date":"2014-01-13","arxiv_id":"1401.2871","repositories_listed":0,"syntology":null},{"url":null,"slug":"safe-and-efficient-screening-for-sparse","title":"Safe and Efficient Screening For Sparse Support Vector Machine","date":"2013-10-30","arxiv_id":"1310.8320","repositories_listed":0,"syntology":null},{"url":null,"slug":"compound-poisson-processes-latent-shrinkage","title":"Compound Poisson Processes, Latent Shrinkage Priors and Bayesian Nonconvex Penalization","date":"2013-08-28","arxiv_id":"1308.6069","repositories_listed":0,"syntology":null},{"url":null,"slug":"safe-screening-with-variational-inequalities","title":"Safe Screening With Variational Inequalities and Its Application to LASSO","date":"2013-07-29","arxiv_id":"1307.7577","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-mixed-norm-regularization","title":"Efficient Mixed-Norm Regularization: Algorithms and Safe Screening Methods","date":"2013-07-16","arxiv_id":"1307.4156","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-task-sparse-learning-with-beta-process","title":"Multi-task Sparse Learning with Beta Process Prior for Action Recognition","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerated-training-for-matrix-norm","title":"Accelerated Training for Matrix-norm Regularization: A Boosting Approach","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"approximate-message-passing-with-consistent","title":"Approximate Message Passing with Consistent Parameter Estimation and Applications to Sparse Learning","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"eigennet-a-bayesian-hybrid-of-generative-and","title":"EigenNet: A Bayesian hybrid of generative and conditional models for sparse learning","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"non-parametric-group-orthogonal-matching","title":"Non-parametric Group Orthogonal Matching Pursuit for Sparse Learning with Multiple Kernels","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multivariate-dyadic-regression-trees-for","title":"Multivariate Dyadic Regression Trees for Sparse Learning Problems","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"nonparametric-greedy-algorithms-for-the","title":"Nonparametric Greedy Algorithms for the Sparse Learning Problem","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-forward-backward-greedy-algorithm","title":"Adaptive Forward-Backward Greedy Algorithm for Sparse Learning with Linear Models","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"a0776246fb3f3593c61493c5272730dcf2e6e320d2cd495c69e443419ae3c84f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}