Publications related to Least-upper-bound property

Improving SAM Requires Rethinking its Optimization Formulation

Volkan Cevher, Kimon Antonakopoulos, Thomas Michaelsen Pethick, Wanyun Xie, Fabian Ricardo Latorre Gomez

This paper rethinks Sharpness-Aware Minimization (SAM), which is originally formulated as a zero-sum game where the weights of a network and a bounded perturbation try to minimize/maximize, respectively, the same differentiable loss. We argue that SAM shou ...

2024

Generalization of Scaled Deep ResNets in the Mean-Field Regime

Volkan Cevher, Grigorios Chrysos, Fanghui Liu

Despite the widespread empirical success of ResNet, the generalization properties of deep ResNet are rarely explored beyond the lazy training regime. In this work, we investigate scaled ResNet in the limit of infinitely deep and wide neural networks, of wh ...

2024

Peak Value-at-Risk Estimation for Stochastic Differential Equations using Occupation Measures

Matteo Raphael Tacchi

This paper proposes an algorithm to upper-bound maximal quantile statistics of a state function over the course of a Stochastic Differential Equation (SDE) system execution. This chance-peak problem is posed as a nonconvex program aiming to maximize the Va ...

IEEE2023

Intrinsic area near the origin for self-similar growth-fragmentations and related random surfaces

François Gaston Ged

We study the behaviour of a natural measure defined on the leaves of the genealogical tree of some branching processes, namely self-similar growth-fragmentation processes. Each particle, or cell, is attributed a positive mass that evolves in continuous tim ...

2022

The completeness of the generalized eigenfunctions and an upper bound for the counting function of the transmission eigenvalue problem for Maxwell equations

Hoài-Minh Nguyên, Jean Louis-Alexandre Fornerod

Cakoni and Nguyen recently proposed very general conditions on the coefficients of Maxwell equations for which they established the discreten ess of the set of eigenvalues of the transmission problem and studied their locations. In this paper, we establish ...

2021

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b, x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m), and c is an element of Z(n). We show that such an integer program can be solved in time ...

ASSOC COMPUTING MACHINERY2020

Restriction of 3D arithmetic Laplace eigenfunctions to a plane

Riccardo Walter Maffucci

We consider a random Gaussian ensemble of Laplace eigenfunctions on the 3D torus, and investigate the 1-dimensional Hausdorff measure ('length') of nodal intersections against a smooth 2-dimensional toral sub-manifold ('surface'). A prior result of ours pr ...

2020

Fundamental Limits for Implanted Antennas: Maximum Power Density Reaching Free Space

Anja Skrivervik, Zvonimir Sipus

Medical implants with communication capability are becoming increasingly popular with today’s trends to continuously monitor patient’s condition. This is a major challenge for antenna designers since the implants are inherently small and placed in a commun ...

2019

Remote Source Coding Under Gaussian Noise: Dueling Roles of Power and Entropy Power

Michael Christoph Gastpar

The distributed remote source coding (the so-called CEO) problem is studied in the case where the underlying source, not necessarily Gaussian, has finite differential entropy and the observation noise is Gaussian. The main result is a new lower bound for t ...

2019

Anytime Heuristic for Weighted Matching Through Altruism-Inspired Behavior

Boi Faltings, Aris Filos Ratsikas, Panayiotis Danassis

We present a novel anytime heuristic (ALMA), inspired by the human principle of altruism, for solving the assignment problem. ALMA is decentralized, completely uncoupled, and requires no communication between the participants. We prove an upper bound on th ...

2019

The Inherent Cost of Remembering Consistently

Rachid Guerraoui, Mihail Igor Zablotchi, Nachshon Cohen

Non-volatile memory (NVM) promises fast, byte-addressable and durable storage, with raw access latencies in the same order of magnitude as DRAM. But in order to take advantage of the durability of NVM, programmers need to design persistent objects which ma ...

2018

The Inherent Cost of Remembering Consistently

Rachid Guerraoui, Mihail Igor Zablotchi, Nachshon Cohen

Non-volatile memory (NVM) promises fast, byte-addressable and durable storage, with raw access latencies in the same order of magnitude as DRAM. But in order to take advantage of the durability of NVM, programmers need to design persistent objects which ma ...

2018

Test and lower bound modeling of keyed shear connections in RC shear walls

Aurelio Muttoni, Cao Linh Hoang, Jesper Harrild Sorensen

This paper presents an investigation into the ultimate behavior of a recently developed design for keyed shear connections. The influence of the key depth on the failure mode and ductility of the connection has been studied by push-off tests. The tests sho ...

Engineering Structures2018

On the Soil-Structure Interaction of Surface Strip Footings at Ultimate Limit State

Lyesse Laloui, Cristiano Garbellini

Theoretical methods for estimating the bearing capacity of surface strip footings usually do not consider soil-structure interaction. A few publications deal with the subject, but all of these either do not apply rigorous methods or do not consider the gen ...

ISSMGE2018

Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b; x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m) and c is an element of Z(n). We show that such an integer program can be solved in time ...

ASSOC COMPUTING MACHINERY2018

On some algebraic and extremal problems in discrete geometry

Seyed Hossein Nassajianmojarrad

In the present thesis, we delve into different extremal and algebraic problems arising from combinatorial geometry. Specifically, we consider the following problems. For any integer

n\ge 3

, we define

e(n)

to be the minimum positive integer such that an ...

EPFL2017

Nonequilibrium localization and the interplay between disorder and interactions

Eduardo Carlo Mascarenhas Moraes

We study the nonequilibrium interplay between disorder and interactions in a closed quantum system. We base our analysis on the notion of dynamical state-space localization, calculated via the Loschmidt echo. Although real-space and state-space localizatio ...

Iop Publishing Ltd2016

Bisector Energy and Few Distinct Distances

Frank de Zeeuw

We define the bisector energy E(P) of a set P in R-2 to be the number of quadruples (a, b, c, d) is an element of P-4 such that a, b determine the same perpendicular bisector as c, d. Equivalently, E(P) is the number of isosceles trapezoids determined by P ...

Springer2016

Accelerated ADMM based on Accelerated Douglas-Rachford Splitting

Colin Neil Jones, Ivan Pejcic

Alternating direction method of multipliers (ADMM) is a form of augmented Lagrangian optimisation algorithm that found its place in many new applications in recent years. This paper explores a possibility for an upgrade of the ADMM by extrapolation-based a ...

Ieee2016

Bounds for Pach's Selection Theorem and for the Minimum Solid Angle in a Simplex

Jan Kyncl

We estimate the selection constant in the following geometric selection theorem by Pach: For every positive integer d, there is a constant such that whenever are n-element subsets of , we can find a point and subsets for every , each of size at least , suc ...

Springer2015