57 citations · 200 across the 66 of their papers we have counts for
10 papers · 1 filter
Certifiable Reachability Learning Using a New Lipschitz Continuous Value Function
Jingqi Li, Donggun Lee, Jaewon Lee +3
We propose a new reachability learning framework for high-dimensional nonlinear systems, focusing on reach-avoid problems. These problems require computing the reach-avoid set, whi…
Approximately Gaussian Replicator Flows: Nonconvex Optimization as a Nash-Convergent Evolutionary Game
Brendon G. Anderson, Samuel Pfrommer, Somayeh Sojoudi
This work leverages tools from evolutionary game theory to solve unconstrained nonconvex optimization problems. Specifically, we lift such a problem to an optimization over probabi…
Ranking Manipulation for Conversational Search Engines
Samuel Pfrommer, Yatong Bai, Tanmay Gautam +1
Major search engine providers are rapidly incorporating Large Language Model (LLM)-generated content in response to user queries. These conversational search engines operate by loa…
Transport of Algebraic Structure to Latent Embeddings
Samuel Pfrommer, Brendon G. Anderson, Somayeh Sojoudi
Machine learning often aims to produce latent embeddings of inputs which lie in a larger, abstract mathematical space. For example, in the field of 3D modeling, subsets of Euclidea…
Pausing Policy Learning in Non-stationary Reinforcement Learning
Hyunin Lee, Ming Jin, Javad Lavaei +1
Real-time inference is a challenge of real-world reinforcement learning due to temporal differences in time-varying environments: the system collects data from the past, updates th…
Absence of spurious solutions far from ground truth: A low-rank analysis with high-order losses
Ziye Ma, Ying Chen, Javad Lavaei +1
Matrix sensing problems exhibit pervasive non-convexity, plaguing optimization with a proliferation of suboptimal spurious solutions. Avoiding convergence to these critical points…