8 papers
Randomized Greedy Methods for Weak Submodular Sensor Selection with Robustness Considerations
Ege C. Kaya, Michael Hibbard, Takashi Tanaka +2
We study a pair of budget- and performance-constrained weak-submodular maximization problems. For computational efficiency, we explore the use of stochastic greedy algorithms which…
Localized Distributional Robustness in Submodular Multi-Task Subset Selection
Ege C. Kaya, Abolfazl Hashemi
In this work, we treat the problem of multi-task submodular optimization from the perspective of local distributional robustness within the neighborhood of a reference distribution…
FedSGM: A Unified Framework for Constraint Aware, Bidirectionally Compressed, Multi-Step Federated Optimization
Antesh Upadhyay, Sang Bin Moon, Abolfazl Hashemi
We introduce FedSGM, a unified framework for federated constrained optimization that addresses four major challenges in federated learning (FL): functional constraints, communicati…
Beyond Convexity: Proximal-Perturbed Lagrangian Methods for Efficient Functional Constrained Optimization
Sang Bin Moon, Jong Gwang Kim, Ashish Chandra +2
Non-convex functional constrained optimization problems have gained substantial attention in machine learning and data science, addressing broad requirements that typically go beyo…
Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization
Antesh Upadhyay, Sang Bin Moon, Abolfazl Hashemi
Large-scale constrained optimization problems are at the core of many tasks in control, signal processing, and machine learning. Notably, problems with functional constraints arise…
Building Machine Learning Challenges for Anomaly Detection in Science
Elizabeth G. Campolongo, Yuan-Tang Chou, Ekaterina Govorkova +148
Scientific discoveries are often made by finding a pattern or object that was not predicted by the known rules of science. Oftentimes, these anomalous events or objects that do not…