Publications associées à Computer-assisted proof

Computer-assisted proof of kernel inequalities

This data set provides a computer-assisted proof for the kernel inequalities needed to prove universal optimality in the paper "Universal optimality of the E_8 and Leech lattices and interpolation formulas" (by Cohn, Kumar, Miller, Radchenko, and Viazovska ...

EPFL Infoscience2023

LISA – A Modern Proof System

Viktor Kuncak, Simon Guilloud, Sankalp Gambhir

We present LISA, a proof system and proof assistant for constructing proofs in schematic first-order logic and axiomatic set theory. The logical kernel of the system is a proof checker for first-order logic with equality and schematic predicate and fun ...

Dagstuhl, Germany, Schloss Dagstuhl - Leibniz-Zentrum fur Informatik2023

Beyond undulation! Body morphology and sensing components of elongated animals and robots reveal skills to maintain competent locomotion

Laura Isabel Paez Coy

Locomotion is an essential evolutive innovation of living beings that allows them to colonize and dominate the planet. As diverse as animal morphologies are (living) and were (extinct), their locomotion modalities are also diverse. In particular, animal mo ...

EPFL2023

Byzantine-Resilient Learning Beyond Gradients: Distributing Evolutionary Search

Rachid Guerraoui, Andrei Kucharavy, Matteo Monti

Modern machine learning (ML) models are capable of impressive performances. However, their prowess is not due only to the improvements in their architecture and training algorithms but also to a drastic increase in computational power used to train them.|S ...

Assoc Computing Machinery2023

Effective Inhibition of TDP-43 Aggregation by Native State Stabilization

Hilal Lashuel, Yllza Jasiqi, Lixin Yang

Preventing the misfolding or aggregation of transactive response DNA binding protein with 43 kDa (TDP-43) is the most actively pursued disease-modifying strategy to treat amyotrophic lateral sclerosis and other neurodegenerative diseases. In this work, we ...

Wiley-VCH Verlag GmbH2024

Slice-Less Optical Arbitrary Waveform Measurement (OAWM) in a Bandwidth of More Than 600 GHz

Tobias Kippenberg, Grigorii Likhachev

We demonstrate an optical arbitrary waveform measurement (OAWM) technique that exploits optical frequency combs as multi-wavelength local oscillators (LO) and that does not require any optical slicing filters. In a proof-of-concept experiment, we achieve r ...

IEEE2022

A proof of the instability of AdS for the Einstein-massless Vlasov system

Georgios Moschidis

In recent years, the conjecture on the instability of Anti-de Sitter spacetime, put forward by Dafermos-Holzegel (Dynamic instability of solitons in 4 + 1 dimesnional gravity with negative cosmological constant, 2006. https://www.dpmms.cam.ac.uk/similar to ...

SPRINGER HEIDELBERG2022

A Toolbox for Barriers on Interactive Oracle Proofs

Alessandro Chiesa

Interactive oracle proofs (IOPs) are a proof system model that combines features of interactive proofs (IPs) and probabilistically checkable proofs (PCPs). IOPs have prominent applications in complexity theory and cryptography, most notably to constructing ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

The Role of Adaptivity in Source Identification with Time Queries

Gergely Odor

Understanding epidemic propagation in large networks is an important but challenging task, especially since we usually lack information, and the information that we have is often counter-intuitive. An illustrative example is the dependence of the final siz ...

EPFL2022

Switchover phenomenon induced by epidemic seeding on geometric networks

Gergely Odor

It is a fundamental question in disease modeling how the initial seeding of an epidemic, spreading over a network, determines its final outcome. One important goal has been to find the seed configuration, which infects the most individuals. Although the id ...

2021

Variance-Reduced Stochastic Learning Under Random Reshuffling

Ali H. Sayed, Bicheng Ying, Kun Yuan

Several useful variance-reduced stochastic gradient algorithms, such as SVRG, SAGA, Finito, and SAG, have been proposed to minimize empirical risks with linear convergence properties to the exact minimizer. The existing convergence results assume uniform d ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

A novel approach to Landau damping of transverse collective instabilities in future hadron colliders

Michael Schenk

Transverse collective instabilities induced by the beam-coupling impedance of the accelerator structure lead to beam quality degradation and pose a major limitation to the machine performance. Landau damping, a powerful stabilising mechanism that can be em ...

EPFL2019

The adaptive interpolation method: a simple scheme to prove replica formulas in Bayesian inference

Nicolas Macris, Jean François Emmanuel Barbier

In recent years important progress has been achieved towards proving the validity of the replica predictions for the (asymptotic) mutual information (or free energy) in Bayesian inference problems. The proof techniques that have emerged appear to be quite ...

SPRINGER HEIDELBERG2019

Some Proofs of Conditional and Joint Biases in RC4 Stream Cipher

Subhadeep Banik

In this paper we present proofs for the new biases in RC4 which were experimentally found and listed out (without theoretical justifi- cations and proofs) in a paper by Vanhoef et al. in USENIX 2015. Their purpose was to exploit the vulnerabilities of RC4 ...

2018

Theoretical Understanding of Some Conditional and Joint Biases in RC4 Stream Cipher

Subhadeep Banik

In this paper we present proofs for the new biases in RC4 which were experimentally found and listed out (without theoretical justifications and proofs) in a paper by Vanhoef et al. in USENIX 2015. Their purpose was to exploit the vulnerabilities of RC4 in ...

IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG2018

Convergence Of Variance-Reduced Learning Under Random Reshuffling

Ali H. Sayed, Bicheng Ying, Kun Yuan

Several useful variance-reduced stochastic gradient algorithms, such as SVRG, SAGA, Finito, and SAG, have been proposed to minimize empirical risks with linear convergence properties to the exact minimizers. The existing convergence results assume uniform ...

IEEE2018

Exponentially long orbits in Hopfield neural networks

Wulfram Gerstner, Johanni Michael Brea, Samuel Pavio Muscinelli

We show that Hopfield neural networks with synchronous dynamics and asymmetric weights admit stable orbits that form sequences of maximal length. For N units, these sequences have length T = 2^N; that is, they cover the full state space. We present a mathe ...

Massachusetts Institute of Technology Press2017

Type Soundness Proofs with Definitional Interpreters

Tiark Rompf, Nada Amin

While type soundness proofs are taught in every graduate PL class, the gap between realistic languages and what is accessible to formal proofs is large. In the case of Scala, it has been shown that its formal model, the Dependent Object Types (DOT) calculu ...

Assoc Computing Machinery2017

Why our best theories of perception lead to Anti-reductionism

Michael Herzog, Adrien Christophe Doerig

Basic percepts and observation sentences, such as "the voltmeter is at 7A", provide the ground truth for realistic theories. Reduction is the second backbone of these theories linking, for example, neuroscience to physics. First, we will show, by mathemati ...

2016

Superlensing using complementary media

Hoài-Minh Nguyên

This paper studies magnifying superlens using complementary media. Superlensing using complementary media was suggested by Veselago in [16] and innovated by Nicorovici et al. in [9] and Pendry in [10]. The study of this problem is difficult due to two fact ...

Gauthier-Villars/Editions Elsevier2015