{"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":"/method/admm/papers/3","list_of":"/method/admm","method":"ADMM","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"date (newest first), then slug","page":3,"pages_in_order":4,"rows_per_page":100,"rows":[201,300],"of":398,"counts":{"archive_papers_tagged":398,"with_a_code_link":97,"where_syntology_ran_a_sample":15,"not_listed_spam_title":0,"listed":398,"listed_where_code_ran":15,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":13,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":13,"listed_every_run_a_failure_of_syntologys_instrument":2,"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":"/method/admm","prev":"/method/admm/papers/2","next":"/method/admm/papers/4","papers":[{"paper":null,"slug":"communication-efficient-distributed-learning-2","title":"Communication Efficient Distributed Learning with Censored, Quantized, and Generalized Group ADMM","date":"2020-09-14","arxiv_id":"2009.06459","n_code_links":0,"syntology":null},{"paper":null,"slug":"alternating-direction-method-of-multipliers-4","title":"Alternating Direction Method of Multipliers for Quantization","date":"2020-09-08","arxiv_id":"2009.03482","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-analysis-of-alternating-direction-method","title":"An Analysis of Alternating Direction Method of Multipliers for Feed-forward Neural Networks","date":"2020-09-06","arxiv_id":"2009.02825","n_code_links":0,"syntology":null},{"paper":"/paper/distributed-optimization-averaging-via-admm","slug":"distributed-optimization-averaging-via-admm","title":"Distributed Optimization, Averaging via ADMM, and Network Topology","date":"2020-09-05","arxiv_id":"2009.02604","n_code_links":1,"syntology":null},{"paper":null,"slug":"privacy-preserving-distributed-zeroth-order","title":"Privacy-Preserving Distributed Zeroth-Order Optimization","date":"2020-08-31","arxiv_id":"2008.13468","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-plausible-differentially-private-admm","title":"Towards Plausible Differentially Private ADMM Based Distributed Machine Learning","date":"2020-08-11","arxiv_id":"2008.04500","n_code_links":0,"syntology":null},{"paper":null,"slug":"faster-stochastic-alternating-direction","title":"Faster Stochastic Alternating Direction Method of Multipliers for Nonconvex Optimization","date":"2020-08-04","arxiv_id":"2008.01296","n_code_links":0,"syntology":null},{"paper":"/paper/quantifying-the-asymptotic-linear-convergence","slug":"quantifying-the-asymptotic-linear-convergence","title":"On the Asymptotic Linear Convergence Speed of Anderson Acceleration Applied to ADMM","date":"2020-07-06","arxiv_id":"2007.02916","n_code_links":1,"syntology":null},{"paper":null,"slug":"harnessing-wireless-channels-for-scalable-and","title":"Harnessing Wireless Channels for Scalable and Privacy-Preserving Federated Learning","date":"2020-07-03","arxiv_id":"2007.01790","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-efficient-smoothing-proximal-gradient","title":"An Efficient Smoothing Proximal Gradient Algorithm for Convex Clustering","date":"2020-06-22","arxiv_id":"2006.12592","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-fast-stochastic-plug-and-play-admm-for","title":"A Fast Stochastic Plug-and-Play ADMM for Imaging Inverse Problems","date":"2020-06-20","arxiv_id":"2006.11630","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-identifying-clusters-from-sum-of-norms","title":"Certifying clusters from sum-of-norms clustering","date":"2020-06-19","arxiv_id":"2006.11355","n_code_links":0,"syntology":null},{"paper":null,"slug":"solving-constrained-cash-problems-with-admm","title":"Solving Constrained CASH Problems with ADMM","date":"2020-06-17","arxiv_id":"2006.09635","n_code_links":0,"syntology":null},{"paper":"/paper/admmirnn-training-rnn-with-stable-convergence","slug":"admmirnn-training-rnn-with-stable-convergence","title":"P-ADMMiRNN: Training RNN with Stable Convergence via An Efficient and Paralleled ADMM Approach","date":"2020-06-10","arxiv_id":"2006.05622","n_code_links":1,"syntology":null},{"paper":null,"slug":"differentially-private-admm-for-convex","title":"Differentially Private ADMM for Convex Distributed Learning: Improved Accuracy via Multi-Step Approximation","date":"2020-05-16","arxiv_id":"2005.07890","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-understanding-the-adversarial","title":"Towards Understanding the Adversarial Vulnerability of Skeleton-based Action Recognition","date":"2020-05-14","arxiv_id":"2005.07151","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-machine-learning-based-framework-for-the","title":"A Machine Learning Based Framework for the Smart Healthcare Monitoring","date":"2020-04-04","arxiv_id":"2004.03360","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-privacy-preserving-dnn-pruning-and-mobile","title":"A Privacy-Preserving-Oriented DNN Pruning and Mobile Acceleration Framework","date":"2020-03-13","arxiv_id":"2003.06513","n_code_links":0,"syntology":null},{"paper":null,"slug":"stochastic-modified-equations-for-continuous","title":"Stochastic Modified Equations for Continuous Limit of Stochastic ADMM","date":"2020-03-07","arxiv_id":"2003.03532","n_code_links":0,"syntology":null},{"paper":"/paper/tuning-free-plug-and-play-proximal-algorithm","slug":"tuning-free-plug-and-play-proximal-algorithm","title":"Tuning-free Plug-and-Play Proximal Algorithm for Inverse Imaging Problems","date":"2020-02-22","arxiv_id":"2002.09611","n_code_links":1,"syntology":null},{"paper":null,"slug":"statistical-optimal-transport-posed-as","title":"Statistical Optimal Transport posed as Learning Kernel Embedding","date":"2020-02-08","arxiv_id":"2002.03179","n_code_links":0,"syntology":null},{"paper":"/paper/simultaneous-prediction-and-community","slug":"simultaneous-prediction-and-community","title":"Simultaneous prediction and community detection for networks with application to neuroimaging","date":"2020-02-05","arxiv_id":"2002.01645","n_code_links":1,"syntology":null},{"paper":null,"slug":"blk-rew-a-unified-block-based-dnn-pruning","title":"BLK-REW: A Unified Block-based DNN Pruning Framework using Reweighted Regularization Method","date":"2020-01-23","arxiv_id":"2001.08357","n_code_links":0,"syntology":null},{"paper":null,"slug":"patdnn-achieving-real-time-dnn-execution-on","title":"PatDNN: Achieving Real-Time DNN Execution on Mobile Devices with Pattern-based Weight Pruning","date":"2020-01-01","arxiv_id":"2001.00138","n_code_links":0,"syntology":null},{"paper":null,"slug":"integrative-generalized-convex-clustering","title":"Integrative Generalized Convex Clustering Optimization and Feature Selection for Mixed Multi-View Data","date":"2019-12-11","arxiv_id":"1912.05449","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-accelerated-correlation-filter-tracker","title":"An Accelerated Correlation Filter Tracker","date":"2019-12-05","arxiv_id":"1912.02854","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-communication-efficient-stochastic-multi","title":"A Communication Efficient Stochastic Multi-Block Alternating Direction Method of Multipliers","date":"2019-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/a-first-order-algorithmic-framework-for-1","slug":"a-first-order-algorithmic-framework-for-1","title":"A First-Order Algorithmic Framework for Distributionally Robust Logistic Regression","date":"2019-12-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"decentralized-sketching-of-low-rank-matrices","title":"Decentralized sketching of low rank matrices","date":"2019-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/fast-polynomial-kernel-classification-for","slug":"fast-polynomial-kernel-classification-for","title":"Fast Polynomial Kernel Classification for Massive Data","date":"2019-11-24","arxiv_id":"1911.10558","n_code_links":1,"syntology":null},{"paper":"/paper/regularized-and-smooth-double-core-tensor","slug":"regularized-and-smooth-double-core-tensor","title":"Regularized and Smooth Double Core Tensor Factorization for Heterogeneous Data","date":"2019-11-24","arxiv_id":"1911.10454","n_code_links":1,"syntology":null},{"paper":null,"slug":"nonconvex-stochastic-nested-optimization-via","title":"Nonconvex Stochastic Nested Optimization via Stochastic ADMM","date":"2019-11-12","arxiv_id":"1911.05167","n_code_links":0,"syntology":null},{"paper":null,"slug":"l-fgadmm-layer-wise-federated-group-admm-for","title":"L-FGADMM: Layer-Wise Federated Group ADMM for Communication Efficient Decentralized Deep Learning","date":"2019-11-09","arxiv_id":"1911.03654","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-accelerated-admm-for-distributed","title":"Learning-Accelerated ADMM for Distributed Optimal Power Flow","date":"2019-11-08","arxiv_id":"1911.03019","n_code_links":0,"syntology":null},{"paper":null,"slug":"deep-learning-for-space-variant-deconvolution","title":"Deep Learning for space-variant deconvolution in galaxy surveys","date":"2019-11-01","arxiv_id":"1911.00443","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-the-proof-of-fixed-point-convergence-for","title":"On the Proof of Fixed-Point Convergence for Plug-and-Play ADMM","date":"2019-10-31","arxiv_id":"1910.14325","n_code_links":0,"syntology":null},{"paper":"/paper/a-first-order-algorithmic-framework-for","slug":"a-first-order-algorithmic-framework-for","title":"A First-Order Algorithmic Framework for Wasserstein Distributionally Robust Logistic Regression","date":"2019-10-28","arxiv_id":"1910.12778","n_code_links":1,"syntology":null},{"paper":null,"slug":"q-gadmm-quantized-group-admm-for","title":"Q-GADMM: Quantized Group ADMM for Communication Efficient Decentralized Machine Learning","date":"2019-10-23","arxiv_id":"1910.10453","n_code_links":0,"syntology":null},{"paper":null,"slug":"bilinear-constraint-based-admm-for-mixed","title":"Bilinear Constraint based ADMM for Mixed Poisson-Gaussian Noise Removal","date":"2019-10-18","arxiv_id":"1910.08206","n_code_links":0,"syntology":null},{"paper":null,"slug":"variable-metric-proximal-gradient-method-with","title":"Variable Metric Proximal Gradient Method with Diagonal Barzilai-Borwein Stepsize","date":"2019-10-15","arxiv_id":"1910.07056","n_code_links":0,"syntology":null},{"paper":null,"slug":"understanding-limitation-of-two-symmetrized","title":"Understanding Limitation of Two Symmetrized Orders by Worst-case Complexity","date":"2019-10-10","arxiv_id":"1910.04366","n_code_links":0,"syntology":null},{"paper":null,"slug":"recycled-admm-improving-the-privacy-and","title":"Recycled ADMM: Improving the Privacy and Accuracy of Distributed Algorithms","date":"2019-10-08","arxiv_id":"1910.04581","n_code_links":0,"syntology":null},{"paper":null,"slug":"convex-shape-prior-for-multi-object","title":"Convex Shape Prior for Multi-Object Segmentation Using a Single Level Set Function","date":"2019-10-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"deep-tensor-admm-net-for-snapshot-compressive","title":"Deep Tensor ADMM-Net for Snapshot Compressive Imaging","date":"2019-10-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"on-the-convergence-of-admm-with-task-adaption","title":"Investigating Customization Strategies and Convergence Behaviors of Task-specific ADMM","date":"2019-09-24","arxiv_id":"1909.10819","n_code_links":0,"syntology":null},{"paper":null,"slug":"renyi-differentially-private-admm-based-l1","title":"Renyi Differentially Private ADMM for Non-Smooth Regularized Optimization","date":"2019-09-18","arxiv_id":"1909.08180","n_code_links":0,"syntology":null},{"paper":null,"slug":"communication-censored-linearized-admm-for","title":"Communication-Censored Linearized ADMM for Decentralized Consensus Optimization","date":"2019-09-15","arxiv_id":"1909.06724","n_code_links":0,"syntology":null},{"paper":"/paper/video-rainsnow-removal-by-transformed-online","slug":"video-rainsnow-removal-by-transformed-online","title":"Video Rain/Snow Removal by Transformed Online Multiscale Convolutional Sparse Coding","date":"2019-09-13","arxiv_id":"1909.06148","n_code_links":1,"syntology":null},{"paper":null,"slug":"an-ultra-efficient-memristor-based-dnn","title":"An Ultra-Efficient Memristor-Based DNN Framework with Structured Weight Pruning and Quantization Using ADMM","date":"2019-08-29","arxiv_id":"1908.11691","n_code_links":0,"syntology":null},{"paper":null,"slug":"tiny-but-accurate-a-pruned-quantized-and","title":"Tiny but Accurate: A Pruned, Quantized and Optimized Memristor Crossbar Framework for Ultra Efficient DNN Implementation","date":"2019-08-27","arxiv_id":"1908.10017","n_code_links":0,"syntology":null},{"paper":null,"slug":"differential-privacy-for-sparse","title":"Differential Privacy for Sparse Classification Learning","date":"2019-08-02","arxiv_id":"1908.00780","n_code_links":0,"syntology":null},{"paper":null,"slug":"gradient-flows-and-accelerated-proximal","title":"Gradient flows and proximal splitting methods: A unified view on accelerated and stochastic optimization","date":"2019-08-02","arxiv_id":"1908.00865","n_code_links":0,"syntology":null},{"paper":null,"slug":"nonconvex-zeroth-order-stochastic-admm","title":"Nonconvex Zeroth-Order Stochastic ADMM Methods with Lower Function Query Complexity","date":"2019-07-30","arxiv_id":"1907.13463","n_code_links":0,"syntology":null},{"paper":null,"slug":"privacy-preserving-distributed-machine","title":"Privacy-preserving Distributed Machine Learning via Local Randomization and ADMM Perturbation","date":"2019-07-30","arxiv_id":"1908.01059","n_code_links":0,"syntology":null},{"paper":null,"slug":"inertial-nonconvex-alternating-minimizations","title":"Inertial nonconvex alternating minimizations for the image deblurring","date":"2019-07-27","arxiv_id":"1907.12945","n_code_links":0,"syntology":null},{"paper":"/paper/on-the-design-of-black-box-adversarial","slug":"on-the-design-of-black-box-adversarial","title":"On the Design of Black-box Adversarial Examples by Leveraging Gradient-free Optimization and Operator Splitting Method","date":"2019-07-26","arxiv_id":"1907.11684","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["LinLabNEU/Blackbox_ADMM"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"learning-privately-over-distributed-features","title":"Learning Privately over Distributed Features: An ADMM Sharing Approach","date":"2019-07-17","arxiv_id":"1907.07735","n_code_links":0,"syntology":null},{"paper":null,"slug":"minimal-sample-subspace-learning-theory-and","title":"Minimal Sample Subspace Learning: Theory and Algorithms","date":"2019-07-13","arxiv_id":"1907.06032","n_code_links":0,"syntology":null},{"paper":null,"slug":"two-block-vs-multi-block-admm-an-empirical","title":"Two-block vs. Multi-block ADMM: An empirical evaluation of convergence","date":"2019-07-10","arxiv_id":"1907.04524","n_code_links":0,"syntology":null},{"paper":"/paper/on-a-randomized-multi-block-admm-for-solving","slug":"on-a-randomized-multi-block-admm-for-solving","title":"On a Randomized Multi-Block ADMM for Solving Selected Machine Learning Problems","date":"2019-07-03","arxiv_id":"1907.01995","n_code_links":1,"syntology":null},{"paper":"/paper/hierarchical-optimal-transport-for-multimodal","slug":"hierarchical-optimal-transport-for-multimodal","title":"Hierarchical Optimal Transport for Multimodal Distribution Alignment","date":"2019-06-27","arxiv_id":"1906.11768","n_code_links":2,"syntology":null},{"paper":null,"slug":"190600066","title":"Optimized Score Transformation for Consistent Fair Classification","date":"2019-05-31","arxiv_id":"1906.00066","n_code_links":0,"syntology":null},{"paper":"/paper/admm-for-efficient-deep-learning-with-global","slug":"admm-for-efficient-deep-learning-with-global","title":"ADMM for Efficient Deep Learning with Global Convergence","date":"2019-05-31","arxiv_id":"1905.13611","n_code_links":1,"syntology":null},{"paper":null,"slug":"clustered-gaussian-graphical-model-via","title":"Clustered Gaussian Graphical Model via Symmetric Convex Clustering","date":"2019-05-30","arxiv_id":"1905.13251","n_code_links":0,"syntology":null},{"paper":null,"slug":"zeroth-order-stochastic-alternating-direction","title":"Zeroth-Order Stochastic Alternating Direction Method of Multipliers for Nonconvex Nonsmooth Optimization","date":"2019-05-29","arxiv_id":"1905.12729","n_code_links":0,"syntology":null},{"paper":null,"slug":"fault-sneaking-attack-a-stealthy-framework","title":"Fault Sneaking Attack: a Stealthy Framework for Misleading Deep Neural Networks","date":"2019-05-28","arxiv_id":"1905.12032","n_code_links":0,"syntology":null},{"paper":null,"slug":"190511937","title":"Efficient MCMC Sampling with Dimension-Free Convergence Rate using ADMM-type Splitting","date":"2019-05-23","arxiv_id":"1905.11937","n_code_links":0,"syntology":null},{"paper":"/paper/differentiable-linearized-admm","slug":"differentiable-linearized-admm","title":"Differentiable Linearized ADMM","date":"2019-05-15","arxiv_id":"1905.06179","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["zzs1994/D-LADMM"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/plug-and-play-methods-provably-converge-with","slug":"plug-and-play-methods-provably-converge-with","title":"Plug-and-Play Methods Provably Converge with Properly Trained Denoisers","date":"2019-05-14","arxiv_id":"1905.05406","n_code_links":1,"syntology":{"ran":1,"of":2,"n_ran_checked":1,"n_instrument":0,"unverified":1,"pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["uclaopt/Provable_Plug_and_Play"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/190503433","slug":"190503433","title":"MAP Inference via L2-Sphere Linear Program Reformulation","date":"2019-05-09","arxiv_id":"1905.03433","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-splitting-based-iterative-algorithm-for-gpu","title":"A Splitting-Based Iterative Algorithm for GPU-Accelerated Statistical Dual-Energy X-Ray CT Reconstruction","date":"2019-05-02","arxiv_id":"1905.00934","n_code_links":0,"syntology":null},{"paper":null,"slug":"toward-extremely-low-bit-and-lossless","title":"Toward Extremely Low Bit and Lossless Accuracy in DNNs with Progressive ADMM","date":"2019-05-02","arxiv_id":"1905.00789","n_code_links":0,"syntology":null},{"paper":null,"slug":"resnet-can-be-pruned-60x-introducing-network","title":"ResNet Can Be Pruned 60x: Introducing Network Purification and Unused Path Removal (P-RM) after Weight Pruning","date":"2019-04-30","arxiv_id":"1905.00136","n_code_links":0,"syntology":null},{"paper":null,"slug":"linear-multiple-low-rank-kernel-based","title":"Linear Multiple Low-Rank Kernel Based Stationary Gaussian Processes Regression for Time Series","date":"2019-04-21","arxiv_id":"1904.09559","n_code_links":0,"syntology":null},{"paper":"/paper/progressive-dnn-compression-a-key-to-achieve","slug":"progressive-dnn-compression-a-key-to-achieve","title":"Progressive DNN Compression: A Key to Achieve Ultra-High Weight Pruning and Quantization Rates using ADMM","date":"2019-03-23","arxiv_id":"1903.09769","n_code_links":2,"syntology":null},{"paper":null,"slug":"a-dual-symmetric-gauss-seidel-alternating","title":"A Dual Symmetric Gauss-Seidel Alternating Direction Method of Multipliers for Hyperspectral Sparse Unmixing","date":"2019-02-25","arxiv_id":"1902.09135","n_code_links":0,"syntology":null},{"paper":"/paper/constrained-risk-budgeting-portfolios-theory","slug":"constrained-risk-budgeting-portfolios-theory","title":"Constrained Risk Budgeting Portfolios: Theory, Algorithms, Applications & Puzzles","date":"2019-02-15","arxiv_id":"1902.05710","n_code_links":1,"syntology":null},{"paper":null,"slug":"iteratively-reweighted-penalty-alternating","title":"Iteratively reweighted penalty alternating minimization methods with continuation for image deblurring","date":"2019-02-09","arxiv_id":"1902.04062","n_code_links":0,"syntology":null},{"paper":"/paper/a-convergence-analysis-of-nonlinearly","slug":"a-convergence-analysis-of-nonlinearly","title":"On ADMM in Deep Learning: Convergence and Saturation-Avoidance","date":"2019-02-06","arxiv_id":"1902.02060","n_code_links":1,"syntology":null},{"paper":"/paper/towards-compact-convnets-via-structure","slug":"towards-compact-convnets-via-structure","title":"Towards Compact ConvNets via Structure-Sparsity Regularized Filter Pruning","date":"2019-01-23","arxiv_id":"1901.07827","n_code_links":1,"syntology":null},{"paper":null,"slug":"linearized-admm-and-fast-nonlocal-denoising","title":"Linearized ADMM and Fast Nonlocal Denoising for Efficient Plug-and-Play Restoration","date":"2019-01-18","arxiv_id":"1901.06110","n_code_links":0,"syntology":null},{"paper":null,"slug":"splitting-methods-for-convex-bi-clustering","title":"Splitting Methods for Convex Bi-Clustering and Co-Clustering","date":"2019-01-18","arxiv_id":"1901.06075","n_code_links":0,"syntology":null},{"paper":null,"slug":"optimal-differentially-private-admm-for","title":"Differentially Private ADMM for Distributed Medical Machine Learning","date":"2019-01-07","arxiv_id":"1901.02094","n_code_links":0,"syntology":null},{"paper":"/paper/admm-nn-an-algorithm-hardware-co-design","slug":"admm-nn-an-algorithm-hardware-co-design","title":"ADMM-NN: An Algorithm-Hardware Co-Design Framework of DNNs Using Alternating Direction Method of Multipliers","date":"2018-12-31","arxiv_id":"1812.11677","n_code_links":1,"syntology":null},{"paper":null,"slug":"monocular-3d-pose-recovery-via-nonconvex","title":"Monocular 3D Pose Recovery via Nonconvex Sparsity with Theoretical Analysis","date":"2018-12-29","arxiv_id":"1812.11295","n_code_links":0,"syntology":null},{"paper":null,"slug":"task-embedded-coordinate-update-a-realizable","title":"Task Embedded Coordinate Update: A Realizable Framework for Multivariate Non-convex Optimization","date":"2018-11-05","arxiv_id":"1811.01587","n_code_links":0,"syntology":null},{"paper":"/paper/a-local-block-coordinate-descent-algorithm","slug":"a-local-block-coordinate-descent-algorithm","title":"A Local Block Coordinate Descent Algorithm for the Convolutional Sparse Coding Model","date":"2018-11-01","arxiv_id":"1811.00312","n_code_links":2,"syntology":null},{"paper":null,"slug":"progressive-weight-pruning-of-deep-neural","title":"Progressive Weight Pruning of Deep Neural Networks using ADMM","date":"2018-10-17","arxiv_id":"1810.07378","n_code_links":0,"syntology":null},{"paper":null,"slug":"recycled-admm-improve-privacy-and-accuracy","title":"Recycled ADMM: Improve Privacy and Accuracy with Less Computation in Distributed Algorithms","date":"2018-10-07","arxiv_id":"1810.03197","n_code_links":0,"syntology":null},{"paper":null,"slug":"approximate-message-passing-for-convex","title":"Approximate message-passing for convex optimization with non-separable penalties","date":"2018-09-17","arxiv_id":"1809.06304","n_code_links":0,"syntology":null},{"paper":null,"slug":"performance-analysis-of-plug-and-play-admm-a","title":"Performance Analysis of Plug-and-Play ADMM: A Graph Signal Processing Perspective","date":"2018-08-31","arxiv_id":"1809.00020","n_code_links":0,"syntology":null},{"paper":null,"slug":"dp-admm-admm-based-distributed-learning-with","title":"DP-ADMM: ADMM-based Distributed Learning with Differential Privacy","date":"2018-08-30","arxiv_id":"1808.10101","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-dynamical-systems-perspective-on-nonsmooth","title":"A Nonsmooth Dynamical Systems Perspective on Accelerated Extensions of ADMM","date":"2018-08-13","arxiv_id":"1808.04048","n_code_links":0,"syntology":null},{"paper":"/paper/structured-adversarial-attack-towards-general","slug":"structured-adversarial-attack-towards-general","title":"Structured Adversarial Attack: Towards General Implementation and Better Interpretability","date":"2018-08-05","arxiv_id":"1808.01664","n_code_links":1,"syntology":{"ran":0,"of":1,"n_ran_checked":0,"n_instrument":0,"unverified":1,"pointer_only":1,"phrase":"0 ran · 1 unverified","official":{"repos":["KaidiXu/StrAttack"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"paper":"/paper/adam-admm-a-unified-systematic-framework-of","slug":"adam-admm-a-unified-systematic-framework-of","title":"StructADMM: A Systematic, High-Efficiency Framework of Structured Weight Pruning for DNNs","date":"2018-07-29","arxiv_id":"1807.11091","n_code_links":1,"syntology":null},{"paper":"/paper/distributed-second-order-convex-optimization","slug":"distributed-second-order-convex-optimization","title":"Newton-ADMM: A Distributed GPU-Accelerated Optimizer for Multiclass Classification Problems","date":"2018-07-18","arxiv_id":"1807.07132","n_code_links":1,"syntology":null},{"paper":null,"slug":"improving-the-privacy-and-accuracy-of-admm","title":"Improving the Privacy and Accuracy of ADMM-Based Distributed Algorithms","date":"2018-06-06","arxiv_id":"1806.02246","n_code_links":0,"syntology":null},{"paper":null,"slug":"l0-norm-based-centers-selection-for-training","title":"l0-norm Based Centers Selection for Training Fault Tolerant RBF Networks and Selecting Centers","date":"2018-05-30","arxiv_id":"1805.11987","n_code_links":0,"syntology":null},{"paper":"/paper/rgb-t-object-trackingbenchmark-and-baseline","slug":"rgb-t-object-trackingbenchmark-and-baseline","title":"RGB-T Object Tracking:Benchmark and Baseline","date":"2018-05-23","arxiv_id":"1805.08982","n_code_links":0,"syntology":null},{"paper":"/paper/structured-nonlinear-variable-selection","slug":"structured-nonlinear-variable-selection","title":"Structured nonlinear variable selection","date":"2018-05-16","arxiv_id":"1805.06258","n_code_links":1,"syntology":null}],"record_sha256":"8ae24a68269dce8b6f055e9854325a2842a6b847f1c5c58fd3fa79b20c0b93bb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}