We study the complexity of optimizing nonsmooth nonconvex Lipschitz functions by
producing $(\delta,\epsilon) $-Goldstein stationary points. Several recent works have …

Bike-sharing systems have become increasingly popular, providing a convenient, cost-
effective, and environmentally friendly transportation option for urban commuters on short …

The aim of this study was to explore the purchase willingness of Chinese consumers for
pork, beef, lamb, and rabbit meat. A conceptual framework and focus group discussions …

As ML models become increasingly complex and integral to high-stakes domains such as
finance and healthcare, they also become more susceptible to sophisticated adversarial …

It is well-known that Resolution proofs can be efficiently simulated by Sherali–Adams (SA)
proofs. We show, however, that any such simulation needs to exploit huge coefficients …

Budget constraints are ubiquitous in online advertisement auctions. To manage these
constraints and smooth out the expenditure across auctions, the bidders (or the platform on …

We consider the problem of computing a (pure) Bayes-Nash equilibrium in the first-price
auction with continuous value distributions and discrete bidding space. We prove that when …

From optimal transport to robust dimensionality reduction, many machine learning
applicationscan be cast into the min-max optimization problems over Riemannian manifolds …

We present a new method for counterfactual explanations (CFEs) based on Bayesian
optimisation that applies to both classification and regression models. Our method is a …

We consider (i) the problem of finding a (possibly mixed) Nash equilibrium in congestion
games, and (ii) the problem of finding an (exponential precision) fixed point of the gradient …