Concept

Interprétations de la probabilité

Publications associées (201)

On the Almost Sure Convergence of Stochastic Gradient Descent in Non-Convex Problems

Volkan Cevher, Ali Kavis, Shaul Nadav Hallak

This paper analyzes the trajectories of stochastic gradient descent (SGD) to help understand the algorithm’s convergence properties in non-convex problems. We first show that the sequence of iterates generated by SGD remains bounded and converges with prob ...

2020

The Cost of Scaling a Reliable Interconnection Topology

Rachid Guerraoui, Alexandre David Olivier Maurer

In distributed computing, many papers try to evaluate the message complexity of a distributed system as a function of the number of nodes n. But what about the cost of building the distributed system itself? Assuming that we want to reliably connect n node ...

2020

Gamma Knife radiosurgery for acromegaly: Evaluating the role of the biological effective dose associated with endocrine remission in a series of 42 consecutive cases

Constantin Tuleasca

Introduction Stereotactic radiosurgery (SRS) is a valuable treatment option for persistent and/or recurrent acromegaly secondary to growth hormone (GH) secreting pituitary adenoma (PA). Here, we assess the role of biological effective dose (BED) received b ...

2020

Entropy production in systems with unidirectional transitions

Daniel Maria Busiello, Amos Maritan

The entropy production is one of the most essential features for systems operating out of equilibrium. The formulation for discrete-state systems goes back to the celebrated Schnakenberg's work and hitherto can be carried out when for each transition betwe ...

2020

Optimization and Generalization of Shallow Neural Networks with Quadratic Activation Functions

Lenka Zdeborová

p>We study the dynamics of optimization and the generalization properties of one-hidden layer neural networks with quadratic activation function in the overparametrized regime where the layer width m is larger than the input dimension d. We conside ...

Curran Associates, Inc.2020

Safe non-smooth black-box optimization with application to policy search

Maryam Kamgarpour, Andreas Krause, Ilnura Usmanova

For safety-critical black-box optimization tasks, observations of the constraints and the objective are often noisy and available only for the feasible points. We propose an approach based on log barriers to find a local solution of a non-convex non-smooth ...

PMLR2020

Who Started This Rumor? Quantifying the Natural Differential Privacy of Gossip Protocols

Rachid Guerraoui, Hadrien Hendrikx

Gossip protocols (also called rumor spreading or epidemic protocols) are widely used to disseminate information in massive peer-to-peer networks. These protocols are often claimed to guarantee privacy because of the uncertainty they introduce on the node t ...

Schloss Dagstuhl, Leibniz-Zentrum2020

Optimistic Distributionally Robust Optimization for Nonparametric Likelihood Approximation

Daniel Kuhn, Viet Anh Nguyen, Soroosh Shafieezadeh Abadeh, Wolfram Wiesemann

The likelihood function is a fundamental component in Bayesian statistics. However, evaluating the likelihood of an observation is computationally intractable in many applications. In this paper, we propose a non-parametric approximation of the likelihood ...

2019

Blockage of driftwood and resulting head increase upstream of an ogee spillway with piers

Anton Schleiss, Michael Pfister, José Pedro Gamito de Saldanha Calado Matos, Paloma Furlan

Accumulations of floating debris in reservoirs can have negative impacts on the safe operation of a dam. Thus, adequate spillway design in view of driftwood is of paramount importance. Herein, investigation of driftwood blockage with a reservoir flow appro ...

Canadian Dam Association2019

F-BLEAU: Fast Black-box Leakage Estimation

Giovanni Cherubin

We consider the problem of measuring how much a system reveals about its secret inputs. We work in the black-box setting: we assume no prior knowledge of the system's internals, and we run the system for choices of secrets and measure its leakage from the ...

IEEE2019

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search