Publications associées à Hypothèse de Riemann

Social Learning Under Inferential Attacks

Ali H. Sayed, Stefan Vlaski, Virginia Bordignon, Konstantinos Ntemos

A common assumption in the social learning literature is that agents exchange information in an unselfish manner. In this work, we consider the scenario where a subset of agents aims at driving the network beliefs to the wrong hypothesis. The adversaries a ...

IEEE2021

Adaptive Social Learning

Ali H. Sayed, Virginia Bordignon

This work proposes a novel strategy for social learning by introducing the critical feature of adaptation. In social learning, several distributed agents update continually their belief about a phenomenon of interest through: i) direct observation of strea ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Fair colorful k-center clustering

Ola Nils Anders Svensson, Xinrui Jia

An instance of colorful k-center consists of points in a metric space that are colored red or blue, along with an integer k and a coverage requirement for each color. The goal is to find the smallest radius rho such that there exist balls of radius rho aro ...

SPRINGER HEIDELBERG2021

Constraint-aware neural networks for Riemann problems

Jan Sickmann Hesthaven, Deep Ray

Neural networks are increasingly used in complex (data-driven) simulations as surrogates or for accelerating the computation of classical surrogates. In many applications physical constraints, such as mass or energy conservation, must be satisfied to obtai ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2020

A Local Law for Singular Values from Diophantine Equations

Marius Christopher Lemm

We introduce the

N\times N

random matrices

X_{j,k}=\exp\left(2\pi i \sum_{q=1}^d\ \omega_{j,q} k^q\right) \quad \text{with } \{\omega_{j,q}\}_{\substack{1\leq j\leq N\\ 1\leq q\leq d}} \text{ i.i.d. random variables},

and

d

a fixed integer. We pr ...

2020

Fair Colorful k-Center Clustering

Ola Nils Anders Svensson, Xinrui Jia

An instance of colorful k-center consists of points in a metric space that are colored red or blue, along with an integer k and a coverage requirement for each color. The goal is to find the smallest radius ρ such that there exist balls of radius ρ around ...

Springer2020

Characterization of image spaces of Riemann-Liouville fractional integral operators on Sobolev spaces W-m,W-p (omega)

Jan Sickmann Hesthaven, Lijing Zhao

Fractional operators are widely used in mathematical models describing abnormal and nonlocal phenomena. Although there are extensive numerical methods for solving the corresponding model problems, theoretical analysis such as the regularity result, or the ...

SCIENCE PRESS2020

MATHICSE Technical Report: Constraint-Aware Neural Networks for Riemann Problems

Jan Sickmann Hesthaven, Deep Ray

MATHICSE2019

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

A Local Law for Singular Values from Diophantine Equations

Marius Christopher Lemm

We introduce the

N\times N

random matrices

X_{j,k}=\exp\left(2\pi i \sum_{q=1}^d\ \omega_{j,q} k^q\right) \quad \text{with } \{\omega_{j,q}\}_{\substack{1\leq j\leq N\\ 1\leq q\leq d}} \text{ i.i.d. random variables},

and

d

a fixed integer. We pr ...

2020

Hypothèse de Riemann

Social Learning Under Inferential Attacks

Adaptive Social Learning

Testing two competing hypotheses for Eurasian jays' caching for the future

Fair colorful k-center clustering

The fourth moment of individual Dirichlet L-functions on the critical line

Constraint-aware neural networks for Riemann problems

A Local Law for Singular Values from Diophantine Equations

Fair Colorful k-Center Clustering

Characterization of image spaces of Riemann-Liouville fractional integral operators on Sobolev spaces W-m,W-p (omega)

MATHICSE Technical Report: Constraint-Aware Neural Networks for Riemann Problems

Graph Chatbot

Chattez avec Graph Search

Adaptive Social Learning

A Local Law for Singular Values from Diophantine Equations

Fair colorful k-center clustering

Testing two competing hypotheses for Eurasian jays' caching for the future

Social Learning Under Inferential Attacks

Fair Colorful k-Center Clustering

The fourth moment of individual Dirichlet L-functions on the critical line

Characterization of image spaces of Riemann-Liouville fractional integral operators on Sobolev spaces W-m,W-p (omega)

MATHICSE Technical Report: Constraint-Aware Neural Networks for Riemann Problems

Constraint-aware neural networks for Riemann problems