South America
Alternating Mirror Descent for Constrained Min-Max Games
An instance of natural occurrences of such constraints is when mixed strategies are used, which correspond to a probability simplex constraint.
Chefs ' Random Tables: Non-Trigonometric Random Features
We introduce chefs' random tables (CRTs), a new class of non-trigonometric random features (RFs) to approximate Gaussian and softmax-kernels.
A Quantitative Geometric Approach to Neural-Network Smoothness
We implement the algorithms induced from this quantitative geometric approach, which are based on semidefinite programming (SDP).
A Unifying Framework for Online Optimization with Long-Term Constraints Matteo Castiglioni Politecnico di Milano Andrea Celli Bocconi University Alberto Marchesi Politecnico di Milano Giulia Romano
Our framework employs traditional regret minimizers as black-box components.
A Unifying Framework for Online Optimization with Long-Term Constraints Matteo Castiglioni Politecnico di Milano Andrea Celli Bocconi University Alberto Marchesi Politecnico di Milano Giulia Romano
Our framework employs traditional regret minimizers as black-box components.