Demo Data from VLDB 2026 / reviewers in the wild / expert
Lauren E. Conger
dblp:328/7154
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Mathematical optimization · 100% | |
| Artificial intelligence
1 paper |
Trustworthy machine learning · 50% Optimization for machine learning · 50% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Mathematical optimization › convergence analysis
non-asymptotic analysis |
0.8 | 1 | 2024 | Learning the Uncertainty Sets of Linear Control Systems via Set Membership: A Non-asymptotic Analysis · ICML 2024 |
Mathematical optimization › control theory
robust control |
0.8 | 1 | 2024 | Learning the Uncertainty Sets of Linear Control Systems via Set Membership: A Non-asymptotic Analysis · ICML 2024 |
Mathematical optimization › control theory › system identification
set membership estimation |
0.8 | 1 | 2024 | Learning the Uncertainty Sets of Linear Control Systems via Set Membership: A Non-asymptotic Analysis · ICML 2024 |
Mathematical optimization › control theory
system identification |
0.8 | 1 | 2024 | Learning the Uncertainty Sets of Linear Control Systems via Set Membership: A Non-asymptotic Analysis · ICML 2024 |
Machine learning › Optimization for machine learning
convergence analysis |
0.7 | 1 | 2023 | Strategic Distribution Shift of Interacting Agents via Coupled Gradient Flows · NeurIPS 2023 |
Machine learning › Trustworthy machine learning › robustness
distribution shift |
0.7 | 1 | 2023 | Strategic Distribution Shift of Interacting Agents via Coupled Gradient Flows · NeurIPS 2023 |
Methods — techniques the papers use, named apart from their topics
set membership estimation · 0.8least-squares estimation · 0.8convergence rate analysis · 0.8partial differential equation modeling · 0.7gradient descent · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Learning the Uncertainty Sets of Linear Control Systems via Set Membership: A Non-asymptotic AnalysisabstractThis paper studies uncertainty set estimation for unknown linear systems. Uncertainty sets are crucial for the quality of robust control since they directly influence the conservativeness of the control design. Departing from the confidence region analysis of least squares estimation, this paper focuses on set membership estimation (SME). Though good numerical performances have attracted applications of SME in the control literature, the non-asymptotic convergence rate of SME for linear systems remains an open question. This paper provides the first convergence rate bounds for SME and discusses variations of SME under relaxed assumptions. We also provide numerical results demonstrating SME’s practical promise. Yingying Li 0005, Jing Yu 0010, Lauren E. Conger, Taylan Kargin, Adam Wierman |
ICML | 3 |
| 2023 | Strategic Distribution Shift of Interacting Agents via Coupled Gradient FlowsabstractWe propose a novel framework for analyzing the dynamics of distribution shift in real-world systems that captures the feedback loop between learning algorithms and the distributions on which they are deployed. Prior work largely models feedback-induced distribution shift as adversarial or via an overly simplistic distribution-shift structure. In contrast, we propose a coupled partial differential equation model that captures fine-grained changes in the distribution over time by accounting for complex dynamics that arise due to strategic responses to algorithmic decision-making, non-local endogenous population interactions, and other exogenous sources of distribution shift. We consider two common settings in machine learning: cooperative settings with information asymmetries, and competitive settings where a learner faces strategic users. For both of these settings, when the algorithm retrains via gradient descent, we prove asymptotic convergence of the retraining procedure to a steady-state, both in finite and in infinite dimensions, obtaining explicit rates in terms of the model parameters. To do so we derive new results on the convergence of coupled PDEs that extends what is known on multi-species systems. Empirically, we show that our approach captures well-documented forms of distribution shifts like polarization and disparate impacts that simpler models cannot capture. Lauren E. Conger, Franca Hoffmann, Eric Mazumdar, Lillian J. Ratliff |
NeurIPS | 1 |