Publication

Robust Maximization of Non-Submodular Objectives

Publications associées (30)

Adaptive Gradient Descent without Descent

We present a strikingly simple proof that two rules are sufficient to automate gradient descent: 1) don’t increase the stepsize too fast and 2) don’t overstep the local curvature. No need for functional values, no line search, no information about the func ...

2020

The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness

Rico Zenklusen, Ola Nils Anders Svensson, Ashkan Norouzi Fard, Moran Feldman

We consider the classical problem of maximizing a monotone submodular function subject to a cardinality constraint, which, due to its numerous applications, has recently been studied in various computational models. We consider a clean multi-player model t ...

ASSOC COMPUTING MACHINERY2020

Tribological Approach to the Watch Movements

Valentine Agnès Madeleine Magnin

Mechanical watches are complex and sensitive systems that have to maintain a faultless precision over their lifetime. However, this precision can be altered by disturbances occurring during the functioning time, such as friction, lubricant drying, or wear, ...

EPFL2020

Full field dependence of primary aberrations in perturbed double-plane symmetric systems with a circular pupil

Toralf Scharf, Alessandro Grosso

This paper deals with the theory of primary aberrations for perturbed double-plane symmetric optical systems consisting of a combination of tilted and decentered surfaces and a circular pupil. First, the analytical expressions describing the full field beh ...

OPTICAL SOC AMER2020

Local Vulnerabilities and Global Robustness of Coupled Dynamical Systems on Complex Networks

Melvyn Sandy Tyloo

Coupled dynamical systems are omnipresent in everyday life. In general, interactions between individual elements composing the system are captured by complex networks. The latter greatly impact the way coupled systems are functioning and evolving in time. ...

EPFL2020

A Spectral Algorithm for 3-valued Function Equivalence Classification

Mathias Soeken

Spectral techniques for Boolean and multiple-valued functions have been well studied and found to be useful in logic design and testing for conventional circuits. Spectral techniques also have potential application for reversible and quantum circuits. This ...

OLD CITY PUBLISHING INC2020

Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms

Ola Nils Anders Svensson, Ashkan Norouzi Fard, Justin Dean Ward

Clustering is a classic topic in optimization with k-means being one of the most fundamental such problems. In the absence of any restrictions on the input, the best-known algorithm for k-means in Euclidean space with a provable guarantee is a simple local ...

SIAM PUBLICATIONS2020

Mechanical oscillator with tunable isochronism defect

Simon Nessim Henein, Mohammad Hussein Kahrobaiyan, Mohamed Gamal Abdelrahman Ahmed Zanaty

Mechanical oscillator (1) for a timepiece comprising an inertial mass (3) arranged to oscillate about a neutral position under the effect of a restoring force provided by at least one elastic element (5),characterised in that said mechanical oscillator (1) ...

2020

Scalable Stochastic Optimization: Scenario Reduction with Guarantees

Kilian Schindler

Stochastic optimization is a popular modeling paradigm for decision-making under uncertainty and has a wide spectrum of applications in management science, economics and engineering. However, the stochastic optimization models one faces in practice are int ...

EPFL2020

Robust Adaptive Decision Making: Bayesian Optimization and Beyond

Ilija Bogunovic

The central task in many interactive machine learning systems can be formalized as the sequential optimization of a black-box function. Bayesian optimization (BO) is a powerful model-based framework for \emph{adaptive} experimentation, where the primary go ...

EPFL2019