← Search

Mahyar Fazlyab

10 accepted papers

2025

Constrained Entropic Unlearning: A Primal-Dual Framework for Large Language Models

NeurIPS 2025poster

Large Language Models (LLMs) deployed in real-world settings increasingly face the need to unlearn sensitive, outdated, or proprietary information. Existing unlearning methods typically formulate forgetting and retention as a regularized trade-off, combining both objectives into a single scalarized…

Cited by 0SourceScholar
2024

Gradient-based Out-of-Distribution Detection

ECCV 2024poster

"One of the challenges for neural networks in real-life applications is the overconfident errors these models make when the data is not from the original training distribution. Addressing this issue is known as Out-of-Distribution (OOD) detection. Many state-of-the-art OOD methods employ an auxiliar…

2024

Learning Performance-oriented Control Barrier Functions Under Complex Safety Constraints and Limited Actuation

CoRL 2024poster

Control Barrier Functions (CBFs) offer an elegant framework for constraining nonlinear control system dynamics to an invariant subset of a pre-specified safe set. However, finding a CBF that simultaneously promotes performance by maximizing the resulting control invariant set while accommodating com…

Cited by 8SourceScholar
2023

Certified Robustness via Dynamic Margin Maximization and Improved Lipschitz Regularization

NeurIPS 2023poster

To improve the robustness of deep classifiers against adversarial perturbations, many approaches have been proposed, such as designing new architectures with better robustness properties (e.g., Lipschitz-capped networks), or modifying the training process itself (e.g., min-max optimization, constrai…

2023

ReachLipBnB: A branch-and-bound method for reachability analysis of neural autonomous systems using Lipschitz bounds

ICRA 2023poster

We propose a novel Branch-and-Bound method for reachability analysis of neural networks in both open-loop and closed-loop settings. Our idea is to first compute accurate bounds on the Lipschitz constant of the neural network in certain directions of interest offline using a convex program. We then u…

Cited by 10SourcecodeScholar
2022

Semidefinite Relaxations of Truncated Least-Squares in Robust Rotation Search: Tight or Not

ECCV 2022poster

"The rotation search problem aims to find a 3D rotation that best aligns a given number of point pairs. To induce robustness against outliers for rotation search, prior work considers truncated least-squares (TLS), which is a non-convex optimization problem, and its semidefinite relaxation (SDR) as…

Cited by 7SourcePDFScholar
2021

Enforcing robust control guarantees within neural network policies

ICLR 2021poster

When designing controllers for safety-critical systems, practitioners often face a challenging tradeoff between robustness and performance. While robust control methods provide rigorous guarantees on system stability under certain worst-case disturbances, they often yield simple controllers that per…

2019

Efficient and Accurate Estimation of Lipschitz Constants for Deep Neural Networks

NeurIPS 2019spotlight

Tight estimation of the Lipschitz constant for deep neural networks (DNNs) is useful in many applications ranging from robustness certification of classifiers to stability analysis of closed-loop systems with reinforcement learning controllers. Existing methods in the literature for estimating the L…

Cited by 581SourcePDFScholar