More Like this

1. GrHDP Solution for Optimal Consensus Control of Multiagent Discrete-Time Systems

   https://doi.org/10.1109/TSMC.2018.2814018  

   Zhong, Xiangnan; He, Haibo (July 2020, IEEE Transactions on Systems, Man, and Cybernetics: Systems)

   null (Ed.)
2. What is optimal in optimal inference?

   https://doi.org/10.1016/j.cobeha.2019.07.008  

   Tavoni, Gaia; Balasubramanian, Vijay; Gold, Joshua I (October 2019, Current Opinion in Behavioral Sciences)
3. Optimal Sets and Solution Paths of ReLU Networks

   Mishkin, Aaron; Pilanci, Mert (January 2023, International Conference on Machine Learning)

   We develop an analytical framework to characterize the set of optimal ReLU neural networks by reformulating the non-convex training problem as a convex program. We show that the global optima of the convex parameterization are given by a polyhedral set and then extend this characterization to the optimal set of the non-convex training objective. Since all stationary points of the ReLU training problem can be represented as optima of sub-sampled convex programs, our work provides a general expression for all critical points of the non-convex objective. We then leverage our results to provide an optimal pruning algorithm for computing minimal networks, establish conditions for the regularization path of ReLU networks to be continuous, and develop sensitivity results for minimal ReLU networks. 

   more » « less
4. Optimal sets and solution paths of ReLU networks

   Mishkin, Aaron (July 2023, ICML'23: Proceedings of the 40th International Conference on Machine Learning)

   We develop an analytical framework to characterize the set of optimal ReLU neural networks by reformulating the non-convex training problem as a convex program. We show that the global optima of the convex parameterization are given by a polyhedral set and then extend this characterization to the optimal set of the nonconvex training objective. Since all stationary points of the ReLU training problem can be represented as optima of sub-sampled convex programs, our work provides a general expression for all critical points of the non-convex objective. We then leverage our results to provide an optimal pruning algorithm for computing minimal networks, establish conditions for the regularization path of ReLU networks to be continuous, and develop sensitivity results for minimal ReLU networks. 

   more » « less
5. Shade is an essential solution for hotter cities

   https://doi.org/10.1038/d41586-023-02311-3  

   Turner, V Kelly; Middel, Ariane; Vanos, Jennifer K (July 2023, Nature)