<h1>Hassibi, Babak</h1> <h2>Monograph from <a href="https://authors.library.caltech.edu">CaltechAUTHORS</a></h2> <ul> <li>Kargin, Taylan and Salehi, Fariborz, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20221222-234253993">Stochastic Mirror Descent in Average Ensemble Models</a>; <a href="https://doi.org/10.48550/arXiv.2210.15323">10.48550/arXiv.2210.15323</a></li> <li>Sabag, Oron and Kostina, Victoria, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20221222-234257392">Feedback capacity of Gaussian channels with memory</a>; <a href="https://doi.org/10.48550/arXiv.2207.10580">10.48550/arXiv.2207.10580</a></li> <li>Sabag, Oron and Lale, Sahin, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220714-224600473">Optimal Competitive-Ratio Control</a>; <a href="https://doi.org/10.48550/arXiv.arXiv.2206.01782">10.48550/arXiv.arXiv.2206.01782</a></li> <li>Azizan, Navid and Lale, Sahin, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220714-212452558">Explicit Regularization via Regularizer Mirror Descent</a>; <a href="https://doi.org/10.48550/arXiv.arXiv.2202.10788">10.48550/arXiv.arXiv.2202.10788</a></li> <li>Lahouti, Farshad and Kostina, Victoria, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220804-201317566">How to Query An Oracle? Efficient Strategies to Label Data</a>; <a href="https://doi.org/10.48550/arXiv.2110.02341">10.48550/arXiv.2110.02341</a></li> <li>Sabag, Oron and Tian, Peida, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220804-201321456">Reducing the LQG Cost with Minimal Communication</a>; <a href="https://doi.org/10.48550/arXiv.2109.12246">10.48550/arXiv.2109.12246</a></li> <li>Goel, Gautam and Hassibi, Babak (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210719-210206675">Regret-optimal Estimation and Control</a>; <a href="https://doi.org/10.48550/arXiv.2106.12097">10.48550/arXiv.2106.12097</a></li> <li>Salehi, Fariborz and Hassibi, Babak (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201109-152308798">Robustifying Binary Classification to Adversarial Perturbation</a>; <a href="https://doi.org/10.48550/arXiv.2010.15391">10.48550/arXiv.2010.15391</a></li> <li>Salehi, Fariborz and Abbasi, Ehsan, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201109-155538204">The Performance Analysis of Generalized Margin Maximizer (GMM) on Separable Data</a>; <a href="https://doi.org/10.48550/arXiv.2010.15379">10.48550/arXiv.2010.15379</a></li> <li>Goel, Gautam and Hassibi, Babak (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201109-155541657">Regret-optimal control in dynamic environments</a>; <a href="https://doi.org/10.48550/arXiv.2010.10473">10.48550/arXiv.2010.10473</a></li> <li>Lale, Sahin and Azizzadenesheli, Kamyar, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201106-120155157">Explore More and Improve Regret in Linear Quadratic Regulators</a>; <a href="https://doi.org/10.48550/arXiv.2007.12291">10.48550/arXiv.2007.12291</a></li> <li>Lale, Sahin and Azizzadenesheli, Kamyar, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200402-131032742">Logarithmic Regret Bound in Partially Observable Linear Dynamical Systems</a>; <a href="https://doi.org/10.48550/arXiv.2003.11227">10.48550/arXiv.2003.11227</a></li> <li>Goel, Gautam and Hassibi, Babak (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200214-105627925">The Power of Linear Controllers in LQR Control</a>; <a href="https://doi.org/10.48550/arXiv.2002.02574">10.48550/arXiv.2002.02574</a></li> <li>Lale, Sahin and Azizzadenesheli, Kamyar, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200214-105620768">Regret Minimization in Partially Observable Linear Quadratic Control</a>; <a href="https://doi.org/10.48550/arXiv.2002.00082">10.48550/arXiv.2002.00082</a></li> <li>Lale, Sahin and Azizzadenesheli, Kamyar, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190327-085817695">Stochastic Linear Bandits with Hidden Low Rank Structure</a>; <a href="https://doi.org/10.48550/arXiv.1901.09490">10.48550/arXiv.1901.09490</a></li> <li>Khina, Anatoly and Nakahira, Yorie, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190402-085532839">Algorithms for Optimal Control with Fixed-Rate Feedback</a>; <a href="https://doi.org/10.48550/arXiv.1809.04917">10.48550/arXiv.1809.04917</a></li> <li>Azizan, Navid and Hassibi, Babak (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190402-101505900">Stochastic Gradient/Mirror Descent: Minimax Optimality and Implicit Regularization</a>; <a href="https://doi.org/10.48550/arXiv.1806.00952">10.48550/arXiv.1806.00952</a></li> <li>Walk, Philipp and Jung, Peter, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190402-101721380">Noncoherent Short-Packet Communication via Modulation on Conjugated Zeros</a>; <a href="https://doi.org/10.48550/arXiv.1805.07876">10.48550/arXiv.1805.07876</a></li> <li>Walk, Philipp and Hassibi, Babak (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190402-102240889">Stable Blind Deconvolution over the Reals from Additional Autocorrelations</a>; <a href="https://doi.org/10.48550/arXiv.1710.07879">10.48550/arXiv.1710.07879</a></li> <li>Thrampoulidis, Christos and Panahi, Ashkan, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150302-080245100">Precise Error Analysis of the ℓ_2-LASSO</a>; <a href="https://doi.org/10.48550/arXiv.1502.04977">10.48550/arXiv.1502.04977</a></li> <li>Esfahanizadeh, Homa and Lahouti, Farshad, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210105-133410359">A Matrix Completion Approach to Linear Index Coding Problem</a>; <a href="https://doi.org/10.48550/arXiv.1408.3046">10.48550/arXiv.1408.3046</a></li> <li>Oymak, Samet and Thrampoulidis, Christos, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150121-072935827">Simple Bounds for Noisy Linear Inverse Problems with Exact Side Information</a>; <a href="https://doi.org/10.48550/arXiv.1312.0641">10.48550/arXiv.1312.0641</a></li> <li>Oymak, Samet and Thrampoulidis, Christos, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150121-073901094">The Squared-Error of Generalized LASSO: A Precise Analysis</a>; <a href="https://doi.org/10.48550/arXiv.1311.0830">10.48550/arXiv.1311.0830</a></li> <li>Bose, Subhonmesh and Bodine-Baron, Elizabeth, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150121-074956983">The Cost of an Epidemic over a Complex Network: A Random Matrix Approach</a>; <a href="https://doi.org/10.48550/arXiv.1309.2236">10.48550/arXiv.1309.2236</a></li> <li>Oymak, Samet and Hassibi, Babak (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150126-075526346">Recovering Jointly Sparse Signals via Joint Basis Pursuit</a>; <a href="https://doi.org/10.48550/arXiv.1202.3531">10.48550/arXiv.1202.3531</a></li> <li>Sukhavasi, Ravi Teja and Hassibi, Babak (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150127-072035730">Error Correcting Codes for Distributed Control</a>; <a href="https://doi.org/10.48550/arXiv.1112.4236">10.48550/arXiv.1112.4236</a></li> <li>Oymak, Samet and Hassibi, Babak (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150127-073728199">Finding Dense Clusters via "Low Rank + Sparse" Decomposition</a>; <a href="https://doi.org/10.48550/arXiv.1104.5186v1">10.48550/arXiv.1104.5186v1</a></li> <li>Chowdhury, Mainak and Oymak, Samet, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150223-073119058">Robustness Analysis of a List Decoding Algorithm for Compressed Sensing</a></li> <li>Oymak, Samet and Hassibi, Babak (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150129-072018732">New Null Space Results and Recovery Thresholds for Matrix Rank Minimization</a>; <a href="https://doi.org/10.48550/arXiv.1011.6326">10.48550/arXiv.1011.6326</a></li> <li>Xu, Weiyu and Hassibi, Babak (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150129-073448689">Compressive Sensing over the Grassmann Manifold: a Unified Geometric Framework</a>; <a href="https://doi.org/10.48550/arXiv.1005.3729">10.48550/arXiv.1005.3729</a></li> <li>Khajehnejad, M. Amin and Dimakis, Alexandros G., el al. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150130-072455533">Sparse Recovery of Positive Signals with Minimal Expansion</a>; <a href="https://doi.org/10.48550/arXiv.0902.4045">10.48550/arXiv.0902.4045</a></li> <li>Jafarpour, Sina and Xu, Weiyu, el al. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190702-111100896">Efficient and Robust Compressed Sensing using High-Quality Expander Graphs</a>; <a href="https://doi.org/10.48550/arXiv.0806.3802">10.48550/arXiv.0806.3802</a></li> <li>Hassibi, Babak and Shadbakht, Sormeh (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150209-072805888">A construction of entropic vectors</a></li> <li>Gupta, Vijay and Chung, Timothy H., el al. (2004) <a href="https://resolver.caltech.edu/CaltechCDSTR:2004.008">On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage</a></li> <li>Gupta, Vijay and Spanos, Demetri, el al. (2004) <a href="https://resolver.caltech.edu/CaltechCDSTR:2004.007">Optimal LQG Control Across a Packet-Dropping Link</a></li> <li>Gupta, Vijay and Hassibi, Babak, el al. (2004) <a href="https://resolver.caltech.edu/CaltechCDSTR:2004.006">A Sub-optimal Algorithm to Synthesize Control Laws for a Network of Dynamic Agents</a></li> <li>Gupta, Vijay and Chung, Timothy H., el al. (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150211-071040084">Scheduling for Distributed Sensor Networks</a></li> <li>Hassibi, Babak and Khorrami, Mohammad (2000) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150302-171200624">Fully-diverse multiple-antenna signal constellations and fixed-point-free Lie groups</a></li> <li>Hassibi, Babak and Kailath, Thomas (1997) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150218-071435753">A Krein Space Interpretation of the Kalman-Yakubovich-Popov Lemma</a></li> </ul>