Publications associées à Borne supérieure et borne inférieure

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

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

IR side of positivity bounds

Francesco Riva, Marc Riembau Saperas, Brando Bellazzini

We show how calculable IR loop effects impact positivity bounds in effective field theories with causal and unitary UV completions. We identify infrared singularities that appear in dispersion relations at |t| less than or similar to m(2). In the massless ...

American Physical Society2022

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

Understanding and Mitigating Latency Variability of Latency-Critical Applications

Mia Primorac

A major theme of IT in the past decade has been the shift from on-premise hardware to cloud computing. Running a service in the public cloud is practical, because a large number of resources can be bought on-demand, but this shift comes with its own set of ...

EPFL2020

Mutual Information and Optimality of Approximate Message-Passing in Random Linear Estimation

Nicolas Macris, Jean François Emmanuel Barbier, Florent Gérard Krzakala, Mohamad Baker Dia

We consider the estimation of a signal from the knowledge of its noisy linear random Gaussian projections. A few examples where this problem is relevant are compressed sensing, sparse superposition codes, and code division multiple access. There has been a ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Quasiconvexity and Relaxation in Optimal Transportation of Closed Differential Forms

Bernard Dacorogna

This manuscript extends the relaxation theory from nonlinear elasticity to electromagnetism and to actions defined on paths of differential forms. The introduction of a gauge allows for a reformulation of the notion of quasiconvexity in Bandyopadhyay et al ...

SPRINGER2019

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