Program for Sunday, March 24th: Talk View

PROGRAM FOR SUNDAY, MARCH 24TH: TALK VIEW

Days:

previous day

all days

View: with abstracts session overview

8:30

9:00

9:30

10:00

10:30

11:00

11:30

12:00

12:30

13:00

13:30

14:00

14:30

15:00

15:30

16:00

08:30-08:52

Private Online Prediction from Experts: Separations and Faster Rates

Hilal Asi, Vitaly Feldman, Tomer Koren, Kunal Talwar

08:52-09:14

Advancements in Differentially Private Stochastic Convex Optimization: Towards Near-Linear Gradient Query

Daogao Liu

09:14-09:36

Adversarial Robustness in the Streaming Model

Samson Zhou

09:36-09:58

Nearly Optimal Algorithms for Privately Learning Thresholds and Approximating Median

Xin Lyu

08:30-08:52

First-order methods for quantum entanglement detection

Javier Pena, Vikesh Siddhu, Sridhar Tayur

08:52-09:14

Accelerating Continuous Variable Coherent Ising Machines via Momentum

Robin Brown, Davide Venturelli, Marco Pavone, David Bernal Neira

09:14-09:36

Constrained local Hamiltonians: quantum generalizations of Vertex Cover

Ojas Parekh, Sankara Sai Chaithanya Rayudu, Kevin Thompson

09:36-09:58

A Quantum Inspired Bi-level Optimization Algorithm for the First Responder Network Design Problem

Ananth Tenneti, Anthony Karahalios, Sridhar Tayur

08:30-08:52

Dealing with disjunctive constraints in convex mixed-integer nonlinear programming: Efficient formulations and strong

Jan Kronqvist

08:52-09:14

Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables

Rui Chen, James Luedtke

09:14-09:36

Building Formulations for Combinatorial Disjunctive Constraints via Biclique Covers

Bochuan Lyu, Illya Hicks, Joey Huchette

09:36-09:58

Aggregated Limited-Memory Rank-1 Cuts

Zhengzhong You, Yu Yang

08:30-08:52

Stochastic FISTA with fully adapative step sizes.

Katya Scheinberg, Trang Tran, Lam Nguyen

08:52-09:14

Stochastic Adaptive Regularization Method with Cubics: A High Probability Complexity Bound

Miaolan Xie, Katya Scheinberg

09:14-09:36

Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical

Wanping Dong, Albert Berahas, Raghu Bollapragada

09:36-09:58

Efficient Gradient Tracking Algorithmic Framework for Decentralized Optimization

Raghu Bollapragada

08:30-08:52

On the number of pivots of Dantzig's simplex methods for linear and convex quadratic programs

Xinyao Zhang, Shaoning Han, Jong-Shi Pang

08:52-09:14

Linear convergence of proximal point methods under Polyak-Łojasiewicz and quadratic growth

Feng-Yi Liao, Lijun Ding, Yang Zheng

09:14-09:36

An Outer Approximation Method for Solving Mixed-Integer Convex Quadratic Programs with Indicators

Linchuan Wei, Simge Küçükyavuz

09:36-09:58

On Integer Programs with Irrational Data

Seyedmohammadhossein Hosseinian, Andrew J. Schaefer

08:30-08:52

Symbolic Learning to Optimize

Atlas Wang

08:52-09:14

Differentiable Cutting-plane Layers for Mixed-integer Linear Optimization

Gabriele Dragotto, Stefan Clarke, Jaime Fernández Fisac, Bartolomeo Stellato

09:14-09:36

Accelerating Non-Convex Optimization via Learned Sequential Convexifications

Rajiv Sambharya, Bartolomeo Stellato

09:36-09:58

Neuromancer: Differentiable Programming Library for Learning to Optimize and Control

J. Drgona, A. Tuor, M. Shapiro, J. Koch, D. Vrabie, R. Birmiwal

08:30-08:52

New Sample Complexity Bounds for (Regularized) Sample Average Approximation in Several Heavy-Tailed, Non-Lipschitzian, and High-Dimensional

Hongcheng Liu, Jindong Tong

08:52-09:14

A Distribution Optimization Framework for Confidence Bounds of Risk Measures

Hao Liang, Zhi-Quan Luo

09:14-09:36

Self-Structured Importance Sampling for Chance-Constrained Optimization

Sai Rakshith S, Anand Deo, Shanyin Tong, Karthyek Murthy, Anirudh Subramanyam

09:36-09:58

Assessing Feasibility With Respect to Stochastic Constraints

David J. Eckman, Shane G. Henderson, Sara Shashaani

08:30-08:52

Policy learning without overlap: Pessimism and generalized Bernstein's inequality

Ying Jin, Zhimei Ren, Zhuoran Yang, Zhaoran Wang

08:52-09:14

First-order Methods for Robust Markov Decision Process

Yan Li, Guanghui Lan, Tuo Zhao

09:14-09:36

Provably learning a multi-head attention layer

Sitan Chen, Yuanzhi Li

09:36-09:58

Neural Network-Based Score Estimation in Diffusion Models: Optimization and Generalization

Yinbin Han, Meisam Razaviyayn, Renyuan Xu

08:30-08:52

Decision-making with Side Information: A Causal Transport Robust Approach

Jincheng Yang, Luhao Zhang, Ningyuan Chen, Rui Gao, Ming Hu

08:52-09:14

Integrated Conditional Estimation-Optimization

Meng Qi, Paul Grigas, Zuo-Jun Shen

09:14-09:36

Contextual Stochastic Bilevel Optimization

Yifan Hu, Jie Wang, Yao Xie, Andreas Krause, Daniel Kuhn

09:36-09:58

SEQUENTIAL COUNTERFACTUAL DECISIONS

Emilio Carrizosa, Jasone Ramírez-Ayerbe, Dolores Romero Morales

08:30-08:52

Adaptive Pricing in Unit Commitment Under Load and Capacity Uncertainty

Dimitris Bertsimas, Angelos Koulouras

08:52-09:14

An exact method for a class of robust nonlinear optimization problems

Danique de Moor

09:14-09:36

Cone product reformulation for global optimization

Thodoris Koukouvinos

08:30-08:52

Random block coordinate descent methods for computing optimal transport and convergence analysis

Yue Xie, Zhongjian Wang, Zhiwen Zhang

08:52-09:14

Generalizations of R0 and SSM properties for Extended Horizontal Linear Complementarity Problem

Punit Yadav, Palpandi K

09:14-09:36

Solving Large-Scale Non-convex Optimization Problems in Neural Network Verification

Huan Zhang

13:00-13:22

Calibrated Stackelberg Games: Learning Optimal Commitments Against Calibrated Agents

Nika Haghtalab, Chara Podimata, Kunhe Yang

13:22-13:44

Content Creator Incentives in Recommender Systems

Meena Jagadeesan

13:44-14:06

Convex Optimization-based Algorithms for Strategic Classification

Lingqing Shen, Fatma Kılınç-Karzan, Nam Ho-Nguyen

14:06-14:28

Enhancing the Diversity in Language Model Assisted Fundraising

Yan Leng, Liu Leqi

13:00-13:22

Towards Constituting Mathematical Structures for Learning to Optimize

Jialin Liu

13:22-13:44

Transformers Meet Image Denoising: Mitigating Over-smoothing in Transformers via Regularized Nonlocal

Tam Nguyen, Tan Nguyen, Richard Baraniuk

13:44-14:06

Advancing Frontiers in DEQs with Applications in OOD Generalization and Diffusion Models

Ashwini Pokle

14:06-14:28

Learning to Predict Equilibria in Convex Games

Daniel McKenzie

13:00-13:22

Neural Embedded Optimization over Sets

Waquar Kaleem, Anirudh Subramanyam

13:22-13:44

A Bilevel Mixed-Integer Program for the Define-Combine Redistricting Procedure

Ian Ludden, Sheldon Jacobson, Douglas King

13:44-14:06

Solving an Advanced Available-to-Promise (AATP) Problem by Optimization and Meta-heuristics

Chi-Bin Cheng, Chao-Jung Cheng

14:06-14:28

Inverse of the Gomory Corner Relaxation of Integer Programs

George Lyu, Fatemeh Nosrat, Andrew Schaefer

13:00-13:22

On the Convergence of a Decomposition Algorithm for Nonlinear Two-Stage Optimization

Yuchen Lou, Andreas Waechter, Ermin Wei

13:22-13:44

A Trust Region SQP Algorithm for Equality Constrained Optimization

Shigeng Sun, Jorge Nocedal

13:44-14:06

Zeroth-order Riemannian Averaging Stochastic Approximation Algorithms

Jiaxiang Li, Krishnakumar Balasubramanian, Shiqian Ma

14:06-14:28

Parsimonious Trajectories in Gradient Descent: Emerging Low-dimensionality in Over-parameterized

Jianhao Ma, Geyu Liang, Salar Fattahi

13:00-13:22

Riemannian Stochastic Variance-Reduced Cubic Regularized Newton Method

Sam Davanloo Tajbakhsh, Dewei Zhang

13:22-13:44

Forward-backward Gaussian variational inference via JKO in the Bures-Wasserstein Space

Krishnakumar Balasubramanian

13:44-14:06

Tangent Subspace Descent on Quotient Manifolds

David Gutman, Nam Ho-Nguyen, Dan Grady, Bruno Mello, Guilherme Menezes

14:06-14:28

Proximal Oracles for Optimization and Sampling

Jiaming Liang, Yongxin Chen

13:00-13:22

Maximizing and Satisficing in Multi-armed Bandits with Graph Information

Parth Thaker, Mohit Malu, Nikhil Rao, Gautam Dasarathy

13:22-13:44

Branching Adaptive Surrogate Search Method for High-dimensional Optimization

Pariyakorn Maneekul, Giulia Pedrielli, Zelda Zabinsky

13:44-14:06

Package Queries for Massive-scale In-Database Decision Support

Peter Haas, Anh Mai, Azza Abouzied, Alexandra Meliou

14:06-14:28

Potential Games on Cubic Splines for Multi-Agent Motion Planning

Sam Williams, Jyotirmoy Deshmukh

13:00-13:22

Recycling Valid Inequalities for Robust Optimization

Arie Koster, Christina Büsing, Timo Gersing

13:22-13:44

A Coordinated Parallelization Algorithm for Compromise Stochastic Programming

Di Zhang, Yihang Zhang, Suvrajeet Sen

13:44-14:06

Branching in the Dual Decomposition Method for Stochastic Integer Programs

Zhichao Ma, Jeffrey Linderoth

14:06-14:28

A Unifying Theory for the Reliability of Stochastic Programming Solutions using Compromise Decisions

Shuotao Diao, Suvrajeet Sen

13:00-13:22

Accelerated Gradient Descent via Long Steps

Benjamin Grimmer, Kevin Shu, Alex Wang

13:22-13:44

Beyond Discretization: Learning the Optimal Solution Path

Qiran Dong, Paul Grigas, Vishal Gupta

13:44-14:06

Advancing SGD: Exploring the Interplay of Stochastic Polyak Step-size and Momentum

Nicolas Loizou

14:06-14:28

Acceleration of Level Adjustment for the Polyak Stepsize: Applications to Convex and Non-Convex

Mikhail Bragin, Anbang Liu

13:00-13:22

On graph sequences with finite-time consensus

Xin Jiang, Edward Duc Hien Nguyen, Bicheng Ying, Cesar A. Uribe

13:22-13:44

On the use of the finite-time consensus property in decentralized optimization

Edward Duc Hien Nguyen, Xin Jiang, Bicheng Ying, Cesar A. Uribe

13:44-14:06

Dual distributed optimization algorithms for potentially disconnected time-varying networks

Bicheng Ying, Edward Duc Hien Nguyen, Xin Jiang, Cesar A. Uribe

14:06-14:28

Understanding the Influence of Directed Networks on Decentralized Optimization: Effective Metrics, Lower Bound, and Optimal

Liyuan Liang, Xinmeng Huang, Ran Xin, Kun Yuan

13:00-13:22

Dimension-Free Zeroth-Order Algorithms for Stochastic Programming Under Dimension-Independent Budget

Hongcheng Liu, Yu Yang, Jindong Tong

13:22-13:44

Efficient and Scalable Reinforcement Learning via Hypermodel

Yingru Li, Zhi-Quan Luo

13:44-14:06

On First-Order Meta-Reinforcement Learning with Moreau Envelopes

Mohammad Taha Toghani, Sebastian Perez-Salazar, César A. Uribe

14:06-14:28

Bayesian optimization of risk based on Student-t process and extreme value statistics

Alexander Vinel, Armin Khayyer

13:00-13:22

Relaxation \& Approximation Algorithm for Solving Sparse PCA Under Robust Uncertainty Set

Guanyi Wang, Yu Yang

13:22-13:44

Robust Personalized Design via Bayesian Optimization under Covariate Uncertainty

Jiacheng Liu, Wenbo Sun, Judy Jin, Jingwen Hu

13:44-14:06

Forecasting Market-Suitable Vegetables by Using a Decision Tree Algorithm

Gómez-Lagos et.al

14:45-15:07

A Conditional Gradient-based Method for Simple Bilevel Optimization with Convex Lower-level Problem

Ruichen Jiang, Nazanin Abolfazli, Aryan Mokhtari, Erfan Yazdandoost Hamedani

15:07-15:29

Optimal Algorithms for Stochastic Bilevel Optimization under Relaxed Smoothness Conditions

Xuxing Chen, Tesi Xiao, Krishnakumar Balasubramanian

15:29-15:51

SimFBO: Towards Simple, Flexible and Communication-efficient Federated Bilevel Learning

Yifan Yang, Peiyao Xiao, Kaiyi Ji

15:51-16:13

On Penalty Methods for Bilevel Optimization

Jeongyeol Kwon, Dohyun Kwon, Stephen Wright, Robert Nowak

14:45-15:07

Learning Optimal and Fair Policies for Online Allocation of Scarce Societal Resources from Data Collected in

Bill Tang, Çağıl Koçyiğit, Eric Rice, Phebe Vayanos

15:07-15:29

Wasserstein Robust Classification with Fairness Constraints

Yijie Wang, Viet Anh Nguyen, Grani Adiwena Hanasusanto

15:29-15:51

Learning Fair Policies for Multi-stage Selection Problems from Observational Data

Zhuangzhuang Jia, Grani A. Hanasusanto, Phebe Vayanos, Weijun Xie

15:51-16:13

On a Fair and Risk-averse Urban Air Mobility Resource Allocation Problem Under Demand and Capacity

Weijun Xie

14:45-15:07

A Cycle Cancelling Heuristic for The Traveling Salesman Problem

Zachary Sorenson, Steffen Borgwardt

15:07-15:29

Who Plays First?

Gabriele Dragotto, Haimin Hu, Jaime Fernández Fisac, Bartolomeo Stellato

15:29-15:51

Flexible Resource Job Scheduling - A Mixed Integer Programming Approach

Vanessa Ann Beddoe Sawkmie, Jeff Linderoth

15:51-16:13

Handling polyhedral symmetries with a dedicated Branch&Cut: application to a knapsack variant

Alexandre Heintzmann, Pascale Bendotti, Cécile Rottner

14:45-15:07

Stochastic Lagrangian-based method for nonconvex optimization with nonlinear constraints

Bang Vu, Dimitri Papadimitriou

15:07-15:29

A NEAR-OPTIMAL METHOD FOR CONSTRAINED COMPOSITE NON-CONVEX NON-SMOOTH PROBLEMS

Wei Liu, Qihang Lin, Yangyang Xu

15:29-15:51

Solving nonmonotone inclusions and Application to nonconvex QP with equality constraints

Dimitri Papadimitriou

15:51-16:13

A Parameter-free and Projection-free Restarting Level Set Method for Constrained Convex Optimization Under the Error Bound

Negar Soheili, Qihang Lin, Selva Nadarajah, Runchao Ma

14:45-15:07

Certification of sums of squares via low-rank optimization

Shixuan Zhang

15:07-15:29

Revisiting Spectral Bundle Methods: Primal-dual (Sub)linear Convergence Rates

Lijun Ding, Benjamin Grimmer

15:29-15:51

Convex Relaxation for Fokker-Planck

Yian Chen, Yuehaw Khoo, Lek-Heng Lim

14:45-15:07

A Quantile Neural Network Framework for Two-stage Stochastic Optimization

Antonio Alcántara, Calvin Tsay

15:07-15:29

A Differentiable Decision Tree Induction Algorithm with Near-optimality

Yankai Cao

15:29-15:51

Data-driven Decision-making with the Optimization & Machine Learning Toolkit (OMLT)

Bashar Ammari, Emma Johnson, Michael Bynum, Carl Laird

15:51-16:13

Decomposition and adaptive sampling for data-driven inverse linear optimization

Rishabh Gupta, Qi Zhang

14:45-15:07

Robust Data-driven Prescriptiveness Optimization

Mehran Poursoltani, Erick Delage, Angelos Georghiou

15:07-15:29

Properties of Two-Stage Stochastic Multiobjective Linear Programs

Akshita Gupta, Susan R. Hunter, Margaret M. Wiecek

15:29-15:51

Optimizing infrastructure system monitoring under stochastic decision-dependent system failures

Juan-Alberto Estrada-Garcia, Siqian Shen

15:51-16:13

A distributed algorithm for multi-scale multi-stage stochastic programs with applications to electricity capacity

Andrew Liu, Run Chen

14:45-15:07

On Polynomial-Time Solvability of Combinatorial Markov Random Fields

Shaoning Han, Andres Gomez, Jong-Shi Pang

15:07-15:29

Constrained Optimization of Low-rank Functions with Indicator Variables

Soroosh Shafiee, Fatma Kilinc-Karzan

15:29-15:51

Higher order graphical models and binary polynomial optimization

Yakun Wang, Aida Khajavirad

15:51-16:13

Algorithms for DC Programming via Polyhedral Approximations of Convex Functions

Fahaar Mansoor Pirani, Firdevs Ulus

14:45-15:07

Generalization Performances in Nonconvex Minimax Optimization: A Comprehensive Study

Siqi Zhang, Yifan Hu, Liang Zhang, Niao He

15:07-15:29

Improving Autoencoder Image Interpolation via Dynamic Optimal Transport

Xue Feng, Thomas Strohmer

15:29-15:51

ALEXR: Optimal Single-Loop Algorithms for Convex Finite-Sum Coupled Compositional Stochastic

Bokun Wang, Tianbao Yang

15:51-16:13

Dimension-Insensitive Stochastic First-Order Methods for Nonconvex Optimization

Yue Xie, Hongcheng Liu

14:45-15:07

Scalable Projection-Free Optimization Methods via MultiRadial Duality Theory

Thabo Samakhoana, Benjamin Grimmer

15:07-15:29

Binary Integer Program Approximation and the Induced Structural Duality

Ningji Wei

15:29-15:51

Rectified Relaxation: A new learning approach for linear optimization with linear and complementary

Jiming Peng, Wissam Alali