← Search

Lucas Liebenwein

7 accepted papers

2025

Nemotron-Flash: Towards Latency-Optimal Hybrid Small Language Models

NeurIPS 2025poster

Efficient deployment of small language models (SLMs) is essential for numerous real-world applications with stringent latency constraints.While previous work on SLM design has primarily focused on reducing the number of parameters to achieve parameter-optimal SLMs, parameter efficiency does not nece…

Cited by 0SourceScholar
2021

Compressing Neural Networks: Towards Determining the Optimal Layer-wise Decomposition

NeurIPS 2021poster

We present a novel global compression framework for deep neural networks that automatically analyzes each layer to identify the optimal per-layer compression ratio, while simultaneously achieving the desired overall compression. Our algorithm hinges on the idea of compressing each convolutional (or…

2021

Sparse Flows: Pruning Continuous-depth Models

NeurIPS 2021poster

Continuous deep learning architectures enable learning of flexible probabilistic models for predictive modeling as neural ordinary differential equations (ODEs), and for generative modeling as continuous normalizing flows. In this work, we design a framework to decipher the internal dynamics of thes…

2020

Deep Latent Competition: Learning to Race Using Visual Control Policies in Latent Space

CoRL 2020

Learning competitive behaviors in multi-agent settings such as racing requires long-term reasoning about potential adversarial interactions. This paper presents Deep Latent Competition (DLC), a novel reinforcement learning algorithm that learns competitive visual control policies through self-play i

2020

Provable Filter Pruning for Efficient Neural Networks

ICLR 2020poster

We present a provable, sampling-based approach for generating compact Convolutional Neural Networks (CNNs) by identifying and removing redundant filters from an over-parameterized network. Our algorithm uses a small batch of input data points to assign a saliency score to each filter and constructs…

Cited by 199SourcecodeScholar
2019

Data-Dependent Coresets for Compressing Neural Networks with Applications to Generalization Bounds

ICLR 2019poster

We present an efficient coresets-based neural network compression algorithm that sparsifies the parameters of a trained fully-connected neural network in a manner that provably approximates the network's output. Our approach is based on an importance sampling scheme that judiciously defines a sampli…

Cited by 98SourcePDFScholar
2018

Sampling-Based Approximation Algorithms for Reachability Analysis with Provable Guarantees

RSS 2018poster

The successful deployment of many autonomous systems in part hinges on providing rigorous guarantees on their performance and safety through a formal verification method, such as reachability analysis. In this work, we present a simple-to-implement, sampling-based algorithm for reachability analysis…

Cited by 30SourcePDFScholar