Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ryan Lucas

dblp:354/3010 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Trustworthy machine learning · 36% Efficient and distributed learning · 32% Optimization for machine learning · 32%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Optimization for machine learning › second-order optimization
hessian-free optimization
0.912025
Preserving Deep Representations in One-Shot Pruning: A Hessian-Free Second-Order Optimization Framework · ICLR 2025
Machine learning › Efficient and distributed learning
model compression
0.912025
Preserving Deep Representations in One-Shot Pruning: A Hessian-Free Second-Order Optimization Framework · ICLR 2025
Machine learning › Efficient and distributed learning › model compression › pruning › DNN pruning
one-shot pruning
0.912025
Preserving Deep Representations in One-Shot Pruning: A Hessian-Free Second-Order Optimization Framework · ICLR 2025
Machine learning › Optimization for machine learning
second-order optimization
0.912025
Preserving Deep Representations in One-Shot Pruning: A Hessian-Free Second-Order Optimization Framework · ICLR 2025
Machine learning › Trustworthy machine learning › robustness
adversarial robustness
0.712023
Certified Robust Neural Networks: Generalization and Corruption Resistance · ICML 2023
Machine learning › Trustworthy machine learning › robustness
certified robustness
0.712023
Certified Robust Neural Networks: Generalization and Corruption Resistance · ICML 2023
Machine learning › Trustworthy machine learning › robustness › robust learning
robust generalization
0.712023
Certified Robust Neural Networks: Generalization and Corruption Resistance · ICML 2023

Methods — techniques the papers use, named apart from their topics

second-order optimization · 0.9newton descent · 0.9hessian-free optimization · 0.9distributionally robust optimization · 0.7adversarial training · 0.7
YearPublicationVenuePosition
2025 Preserving Deep Representations in One-Shot Pruning: A Hessian-Free Second-Order Optimization Framework
abstract
We present SNOWS, a one-shot post-training pruning framework aimed at reducing the cost of vision network inference without retraining. Current leading one-shot pruning methods minimize layer-wise least squares reconstruction error which does not take into account deeper network representations. We propose to optimize a more global reconstruction objective. This objective accounts for nonlinear activations deep in the network to obtain a better proxy for the network loss. This nonlinear objective leads to a more challenging optimization problem---we demonstrate it can be solved efficiently using a specialized second-order optimization framework. A key innovation of our framework is the use of Hessian-free optimization to compute exact Newton descent steps without needing to compute or store the full Hessian matrix. A distinct advantage of SNOWS is that it can be readily applied on top of any sparse mask derived from prior methods, readjusting their weights to preserve deep feature representations. SNOWS obtains state-of-the-art results on various one-shot pruning benchmarks including residual networks and Vision Transformers (ViT/B-16 and ViT/L-16, 86m and 304m parameters respectively). Our open-source implementation is available at https://github.com/mazumder-lab/SNOWS.
Ryan Lucas, Rahul Mazumder
ICLR1
2023 Certified Robust Neural Networks: Generalization and Corruption Resistance
abstract
Recent work have demonstrated that robustness (to "corruption") can be at odds with generalization. Adversarial training, for instance, aims to reduce the problematic susceptibility of modern neural networks to small data perturbations. Surprisingly, overfitting is a major concern in adversarial training despite being mostly absent in standard training. We provide here theoretical evidence for this peculiar ``robust overfitting'' phenomenon. Subsequently, we advance a novel distributionally robust loss function bridging robustness and generalization. We demonstrate both theoretically as well as empirically the loss to enjoy a certified level of robustness against two common types of corruption|data evasion and poisoning attacks|while ensuring guaranteed generalization. We show through careful numerical experiments that our resulting holistic robust (HR) training procedure yields SOTA performance. Finally, we indicate that HR training can be interpreted as a direct extension of adversarial training and comes with a negligible additional computational burden. A ready-to-use python library implementing our algorithm is available at https://github.com/RyanLucas3/HR_Neural_Networks.
M. Amine Bennouna, Ryan Lucas, Bart P. G. Van Parys
ICML2