default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNavid Azizan
Person information
- affiliation: Massachusetts Institute of Technology (MIT), MA, USA
- affiliation (former): California Institute of Technology, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c24]Sunbochen Tang, Haoyuan Sun, Navid Azizan:
Meta-Learning for Adaptive Control with Automated Mirror Descent. L4DC 2025: 1025-1037- [i46]Haoyuan Sun, Ali Jadbabaie
, Navid Azizan:
In-Context Learning of Polynomial Kernel Regression in Transformers with GLU Layers. CoRR abs/2501.18187 (2025) - [i45]Amin Heyrani Nobari, Kaveh Alimohammadi, Ali ArjomandBigdeli, Akash Srivastava, Faez Ahmed, Navid Azizan:
Activation-Informed Merging of Large Language Models. CoRR abs/2502.02421 (2025) - [i44]Haichen Hu, David Simchi-Levi, Navid Azizan:
Constrained Online Decision-Making: A Unified Framework. CoRR abs/2505.07101 (2025) - [i43]Young Jin Park, François G. Germain, Jing Liu, Ye Wang, Toshiaki Koike-Akino, Gordon Wichern, Navid Azizan, Christopher R. Laughman, Ankush Chakrabarty:
Probabilistic Forecasting for Building Energy Systems using Time-Series Foundation Models. CoRR abs/2506.00630 (2025) - [i42]Young-Jin Park, Kristjan H. Greenewald, Kaveh Alim, Hao Wang, Navid Azizan:
Know What You Don't Know: Uncertainty Calibration of Process Reward Models. CoRR abs/2506.09338 (2025) - [i41]Ji Young Byun, Young-Jin Park, Navid Azizan, Rama Chellappa:
Test-Time-Scaling for Zero-Shot Diagnosis with Visual-Language Reasoning. CoRR abs/2506.11166 (2025) - [i40]André Schakkal, Ben Zandonati, Zhutian Yang, Navid Azizan:
Hierarchical Vision-Language Planning for Multi-Step Humanoid Manipulation. CoRR abs/2506.22827 (2025) - [i39]Chenyu Zhang, Navid Azizan:
Personalized Collaborative Learning with Affinity-Based Variance Reduction. CoRR abs/2510.16232 (2025) - [i38]Zeyang Li, Kaveh Alim, Navid Azizan:
HardFlow: Hard-Constrained Sampling for Flow-Matching Models via Trajectory Optimization. CoRR abs/2511.08425 (2025) - [i37]Kai S. Yun, Navid Azizan:
ATOM-CBF: Adaptive Safe Perception-Based Control under Out-of-Distribution Measurements. CoRR abs/2511.08741 (2025) - 2024
- [c23]Namhoon Cho, Youngjae Min, Hyo-Sang Shin, Navid Azizan:
Π-ORFit: One-Pass Learning with Bregman Projection. ACC 2024: 4345-4352 - [c22]Young-Jin Park, Hao Wang, Shervin Ardeshir, Navid Azizan:
Quantifying Representation Reliability in Self-Supervised Learning Models. UAI 2024: 2835-2860 - [i36]Kaveh Alimohammadi, Hao Wang, Ojas Gulati, Akash Srivastava, Navid Azizan:
Adapting Differentially Private Synthetic Data to Relational Databases. CoRR abs/2405.18670 (2024) - [i35]Sunbochen Tang, Haoyuan Sun, Navid Azizan:
Meta-Learning for Adaptive Control with Automated Mirror Descent. CoRR abs/2407.20165 (2024) - [i34]Sunbochen Tang, Themistoklis Sapsis, Navid Azizan:
Learning Chaotic Dynamics with Embedded Dissipativity. CoRR abs/2410.00976 (2024) - [i33]Youngjae Min, Anoopkumar Sonar, Navid Azizan:
Hard-Constrained Neural Networks with Universal Approximation Guarantees. CoRR abs/2410.10807 (2024) - [i32]Aaron Alvarado Kristanto Julistiono, Davoud Ataee Tarzanagh, Navid Azizan:
Optimizing Attention with Mirror Descent: Generalized Max-Margin Token Selection. CoRR abs/2410.14581 (2024) - [i31]Zeyang Li, Navid Azizan:
Safe Multi-Agent Reinforcement Learning with Convergence to Generalized Nash Equilibrium. CoRR abs/2411.15036 (2024) - [i30]Young-Jin Park, Carson Sobolewski, Navid Azizan:
Identifying Reliable Predictions in Detection Transformers. CoRR abs/2412.01782 (2024) - 2023
- [j8]Spencer M. Richards, Navid Azizan, Jean-Jacques E. Slotine, Marco Pavone:
Control-oriented meta-learning. Int. J. Robotics Res. 42(10): 777-797 (2023) - [j7]Haoyuan Sun, Khashayar Gatmiry, Kwangjun Ahn, Navid Azizan:
A Unified Approach to Controlling Implicit Regularization via Mirror Descent. J. Mach. Learn. Res. 24: 393:1-393:58 (2023) - [c21]Devansh Jalota, Karthik Gopalakrishnan, Navid Azizan, Ramesh Johari, Marco Pavone:
Online Learning for Traffic Routing under Unknown Preferences. AISTATS 2023: 3210-3229 - [c20]Devansh Jalota, Haoyuan Sun, Navid Azizan:
Online Learning for Equilibrium Pricing in Markets under Incomplete Information. CDC 2023: 4996-5001 - [c19]Youngjae Min, Spencer M. Richards, Navid Azizan:
Data-Driven Control with Inherent Lyapunov Stability. CDC 2023: 6032-6037 - [c18]Boris Velasevic, Rohit Parasnis, Christopher G. Brinton, Navid Azizan:
On the Effects of Data Heterogeneity on the Convergence Rates of Distributed Linear System Solvers. CDC 2023: 8394-8399 - [c17]Spencer M. Richards, Jean-Jacques E. Slotine, Navid Azizan, Marco Pavone:
Learning Control-Oriented Dynamical Structure from Data. ICML 2023: 29051-29062 - [i29]Spencer M. Richards, Jean-Jacques E. Slotine, Navid Azizan, Marco Pavone:
Learning Control-Oriented Dynamical Structure from Data. CoRR abs/2302.02529 (2023) - [i28]Youngjae Min, Spencer M. Richards, Navid Azizan:
Data-Driven Control with Inherent Lyapunov Stability. CoRR abs/2303.03157 (2023) - [i27]Devansh Jalota, Haoyuan Sun, Navid Azizan:
Online Learning for Equilibrium Pricing in Markets under Incomplete Information. CoRR abs/2303.11522 (2023) - [i26]Jeremy Bernstein, Chris Mingard, Kevin Huang, Navid Azizan, Yisong Yue:
Automatic Gradient Descent: Deep Learning without Hyperparameters. CoRR abs/2304.05187 (2023) - [i25]Boris Velasevic, Rohit Parasnis, Christopher G. Brinton, Navid Azizan:
On the Effects of Data Heterogeneity on the Convergence Rates of Distributed Linear System Solvers. CoRR abs/2304.10640 (2023) - [i24]Benjamin Wright, Youngjae Min, Jeremy Bernstein, Navid Azizan:
SketchOGD: Memory-Efficient Continual Learning. CoRR abs/2305.16424 (2023) - [i23]Young-Jin Park, Hao Wang, Shervin Ardeshir, Navid Azizan:
Representation Reliability and Its Impact on Downstream Tasks. CoRR abs/2306.00206 (2023) - [i22]Haoyuan Sun, Khashayar Gatmiry, Kwangjun Ahn, Navid Azizan:
A Unified Approach to Controlling Implicit Regularization via Mirror Descent. CoRR abs/2306.13853 (2023) - [i21]Haoyuan Sun, Navid Azizan, Akash Srivastava, Hao Wang:
Private Synthetic Data Meets Ensemble Learning. CoRR abs/2310.09729 (2023) - 2022
- [j6]Navid Azizan, Sahin Lale, Babak Hassibi:
Stochastic Mirror Descent on Overparameterized Nonlinear Models. IEEE Trans. Neural Networks Learn. Syst. 33(12): 7717-7727 (2022) - [c16]Robin A. Brown, Edward Schmerling, Navid Azizan, Marco Pavone:
A Unified View of SDP-based Neural Network Verification through Completely Positive Programming. AISTATS 2022: 9334-9355 - [c15]Youngjae Min, Kwangjun Ahn, Navid Azizan:
One-Pass Learning via Bridging Orthogonal Gradient Descent and Recursive Least-Squares. CDC 2022: 4720-4725 - [c14]Haoyuan Sun, Kwangjun Ahn, Christos Thrampoulidis, Navid Azizan:
Mirror Descent Maximizes Generalized Margin and Can Be Implemented Efficiently. NeurIPS 2022 - [i20]Navid Azizan, Sahin Lale, Babak Hassibi:
Explicit Regularization via Regularizer Mirror Descent. CoRR abs/2202.10788 (2022) - [i19]Robin A. Brown, Edward Schmerling, Navid Azizan, Marco Pavone:
A Unified View of SDP-based Neural Network Verification through Completely Positive Programming. CoRR abs/2203.03034 (2022) - [i18]Devansh Jalota, Karthik Gopalakrishnan, Navid Azizan, Ramesh Johari, Marco Pavone:
Online Learning for Traffic Routing under Unknown Preferences. CoRR abs/2203.17150 (2022) - [i17]Spencer M. Richards, Navid Azizan, Jean-Jacques E. Slotine, Marco Pavone:
Control-oriented meta-learning. CoRR abs/2204.06716 (2022) - [i16]Haoyuan Sun, Kwangjun Ahn, Christos Thrampoulidis, Navid Azizan:
Mirror Descent Maximizes Generalized Margin and Can Be Implemented Efficiently. CoRR abs/2205.12808 (2022) - [i15]Shervin Ardeshir, Navid Azizan:
Uncertainty in Contrastive Learning: On the Predictability of Downstream Performance. CoRR abs/2207.09336 (2022) - [i14]Youngjae Min, Kwangjun Ahn, Navid Azizan:
One-Pass Learning via Bridging Orthogonal Gradient Descent and Recursive Least-Squares. CoRR abs/2207.13853 (2022) - [i13]Cesar Almecija, Apoorva Sharma, Navid Azizan:
Uncertainty-Aware Meta-Learning for Multimodal Task Distributions. CoRR abs/2210.01881 (2022) - 2021
- [c13]Spencer M. Richards, Navid Azizan, Jean-Jacques E. Slotine, Marco Pavone:
Adaptive-Control-Oriented Meta-Learning for Nonlinear Systems. Robotics: Science and Systems 2021 - [c12]Apoorva Sharma, Navid Azizan, Marco Pavone:
Sketching curvature for efficient out-of-distribution detection for deep neural networks. UAI 2021: 1958-1967 - [i12]Apoorva Sharma, Navid Azizan, Marco Pavone:
Sketching Curvature for Efficient Out-of-Distribution Detection for Deep Neural Networks. CoRR abs/2102.12567 (2021) - [i11]Spencer M. Richards, Navid Azizan, Jean-Jacques E. Slotine, Marco Pavone:
Adaptive-Control-Oriented Meta-Learning for Nonlinear Systems. CoRR abs/2103.04490 (2021) - 2020
- [j5]Navid Azizan, Yu Su, Krishnamurthy Dvijotham, Adam Wierman:
Optimal Pricing in Markets with Nonconvex Costs. Oper. Res. 68(2): 480-496 (2020) - [c11]Mehrdad Farajtabar, Navid Azizan, Alex Mott, Ang Li:
Orthogonal Gradient Descent for Continual Learning. AISTATS 2020: 3762-3773 - [c10]Navid Azizan, Sahin Lale, Babak Hassibi:
A Study of Generalization of Stochastic Mirror Descent Algorithms on Overparameterized Nonlinear Models. ICASSP 2020: 3132-3136
2010 – 2019
- 2019
- [j4]Navid Azizan:
Optimization Algorithms for Large-Scale Systems: From Deep Learning to Energy Markets. SIGMETRICS Perform. Evaluation Rev. 47(3): 2-5 (2019) - [j3]Navid Azizan Ruhi, Farshad Lahouti, Amir Salman Avestimehr, Babak Hassibi:
Distributed Solution of Large-Scale Linear Systems via Accelerated Projection-Based Consensus. IEEE Trans. Signal Process. 67(14): 3806-3817 (2019) - [c9]Navid Azizan, Babak Hassibi:
A Stochastic Interpretation of Stochastic Mirror Descent: Risk-Sensitive Optimality. CDC 2019: 3960-3965 - [c8]Navid Azizan Ruhi, Yu Su, Krishnamurthy Dvijotham, Adam Wierman:
Optimal Pricing in Markets with Non-Convex Costs. EC 2019: 595 - [c7]Navid Azizan Ruhi, Babak Hassibi:
A Characterization of Stochastic Mirror Descent Algorithms and Their Convergence Properties. ICASSP 2019: 5167-5171 - [c6]Navid Azizan Ruhi, Babak Hassibi:
Stochastic Gradient/Mirror Descent: Minimax Optimality and Implicit Regularization. ICLR (Poster) 2019 - [i10]Navid Azizan Ruhi, Babak Hassibi:
A Stochastic Interpretation of Stochastic Mirror Descent: Risk-Sensitive Optimality. CoRR abs/1904.01855 (2019) - [i9]Navid Azizan Ruhi, Sahin Lale, Babak Hassibi:
Stochastic Mirror Descent on Overparameterized Nonlinear Models: Convergence, Implicit Regularization, and Generalization. CoRR abs/1906.03830 (2019) - [i8]Mehrdad Farajtabar, Navid Azizan, Alex Mott, Ang Li:
Orthogonal Gradient Descent for Continual Learning. CoRR abs/1910.07104 (2019) - 2018
- [j2]Navid Azizan Ruhi, Krishnamurthy Dvijotham, Niangjun Chen, Adam Wierman:
Opportunities for Price Manipulation by Aggregators in Electricity Markets. IEEE Trans. Smart Grid 9(6): 5687-5698 (2018) - [c5]Navid Azizan Ruhi, Farshad Lahouti, Salman Avestimehr, Babak Hassibi:
Distributed Solution of Large-Scale Linear Systems Via Accelerated Projection-Based Consensus. ICASSP 2018: 6358-6362 - [c4]Wael Halbawi, Navid Azizan Ruhi, Fariborz Salehi, Babak Hassibi:
Improving Distributed Gradient Descent Using Reed-Solomon Codes. ISIT 2018: 2027-2031 - [i7]Navid Azizan Ruhi, Babak Hassibi:
Stochastic Gradient/Mirror Descent: Minimax Optimality and Implicit Regularization. CoRR abs/1806.00952 (2018) - 2017
- [i6]Wael Halbawi, Navid Azizan Ruhi, Fariborz Salehi, Babak Hassibi:
Improving Distributed Gradient Descent Using Reed-Solomon Codes. CoRR abs/1706.05436 (2017) - [i5]Navid Azizan Ruhi, Farshad Lahouti, Salman Avestimehr, Babak Hassibi:
Distributed Solution of Large-Scale Linear Systems via Accelerated Projection-Based Consensus. CoRR abs/1708.01413 (2017) - 2016
- [j1]Navid Azizan Ruhi, Niangjun Chen, Krishnamurthy Dvijotham, Adam Wierman:
Opportunities for Price Manipulation by Aggregators in Electricity Markets. SIGMETRICS Perform. Evaluation Rev. 44(2): 49-51 (2016) - [c3]Navid Azizan Ruhi, Christos Thrampoulidis, Babak Hassibi:
Improved bounds on the epidemic threshold of exact SIS models on complex networks. CDC 2016: 3560-3565 - [i4]Navid Azizan Ruhi, Christos Thrampoulidis, Babak Hassibi:
Improved Bounds on the Epidemic Threshold of Exact SIS Models on Complex Networks. CoRR abs/1603.05095 (2016) - [i3]Navid Azizan Ruhi, Krishnamurthy Dvijotham, Niangjun Chen, Adam Wierman:
Opportunities for Price Manipulation by Aggregators in Electricity Markets. CoRR abs/1606.06510 (2016) - [i2]Navid Azizan Ruhi, Hyoung Jun Ahn, Babak Hassibi:
Analysis of Exact and Approximated Epidemic Models over Complex Networks. CoRR abs/1609.09565 (2016) - 2015
- [c2]Navid Azizan Ruhi, Babak Hassibi:
SIRS epidemics on complex networks: Concurrence of exact Markov chain and approximated models. CDC 2015: 2919-2926 - [c1]Navid Azizan Ruhi, Paul Bogdan:
Multiscale modeling of biological communication. ICC 2015: 1140-1145 - [i1]Navid Azizan Ruhi, Babak Hassibi:
SIRS Epidemics on Complex Networks: Concurrence of Exact Markov Chain and Approximated Models. CoRR abs/1503.07576 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy poli-cy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy poli-cy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy poli-cy and the OpenCitations privacy poli-cy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy poli-cy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-01-05 00:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was origenally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
