Publications associées à Entier friable

An Efficient Sampling Algorithm for Non-smooth Composite Potentials

We consider the problem of sampling from a density of the form p(x) ? exp(-f (x) - g(x)), where f : Rd-+ R is a smooth function and g : R-d-+ R is a convex and Lipschitz function. We propose a new algorithm based on the Metropolis-Hastings framework. Under ...

MICROTOME PUBL2022

Continuous-Domain Formulation of Inverse Problems for Composite Sparse-Plus-Smooth Signals

Michaël Unser, Shayan Aziznejad, Thomas Jean Debarre

We present a novel framework for the reconstruction of 1D composite signals assumed to be a mixture of two additive components, one sparse and the other smooth, given a finite number of linear measurements. We formulate the reconstruction problem as a cont ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Hard criteria for empirical theories of consciousness

Michael Herzog, Adrien Christophe Doerig, Aaron Schurger

Consciousness is now a well-established field of empirical research. A large body of experimental results has been accumulated and is steadily growing. In parallel, many Theories of Consciousness (ToCs) have been proposed. These theories are diverse in nat ...

2020

Efficient Greedy Coordinate Descent for Composite Problems

Martin Jaggi, Sebastian Urban Stich, Anastasiia Koloskova, Sai Praneeth Reddy Karimireddy

Coordinate descent with random coordinate selection is the current state of the art for many large scale optimization problems. However, greedy selection of the steepest coordinate on smooth problems can yield convergence rates independent of the dimension ...

2019

Efficient Greedy Coordinate Descent for Composite Problems

Martin Jaggi, Sebastian Urban Stich, Anastasiia Koloskova, Sai Praneeth Reddy Karimireddy

MICROTOME PUBLISHING2019

Computation of a 768-Bit Prime Field Discrete Logarithm

Arjen Lenstra, Thorsten Kleinjung

This paper reports on the number field sieve computation of a 768-bit prime field discrete logarithm, describes the different parameter optimizations and resulting algorithmic changes compared to the factorization of a 768-bit RSA modulus, and briefly disc ...

Springer International Publishing Ag2017

Contextualizing the co-creation of artefacts within the nested social structure of a collaborative MOOC

Pierre Dillenbourg, Kshitij Sharma, Stian Haklev

MOOCs have traditionally been seen as providing an individual learning experience, however there is an increasing trend towards enabling social learning in MOOCs. To make online learning at scale more social and collaborative, some MOOCs have introduced co ...

2017

Smooth Shapes with Spherical Topology: Beyond Traditional Modeling, Efficient Deformation, and Interaction

Michaël Unser, Pablo Garcia-Amorena Garcia, Daniel Andreas Schmitter

Existing shape models with spherical topology are typically designed either in the discrete domain using interpolating polygon meshes or in the continuous domain using smooth but non-interpolating schemes such as subdivision or NURBS. Both polygon models a ...

2017

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.

Entier friable

An Efficient Sampling Algorithm for Non-smooth Composite Potentials

Demography of galactic technosignatures

Continuous-Domain Formulation of Inverse Problems for Composite Sparse-Plus-Smooth Signals

On the Discreteness of Transmission Eigenvalues for the Maxwell Equations

Hard criteria for empirical theories of consciousness

Efficient Greedy Coordinate Descent for Composite Problems

Efficient Greedy Coordinate Descent for Composite Problems

Computation of a 768-Bit Prime Field Discrete Logarithm

Contextualizing the co-creation of artefacts within the nested social structure of a collaborative MOOC

Smooth Shapes with Spherical Topology: Beyond Traditional Modeling, Efficient Deformation, and Interaction

Graph Chatbot

Chattez avec Graph Search

Continuous-Domain Formulation of Inverse Problems for Composite Sparse-Plus-Smooth Signals

An Efficient Sampling Algorithm for Non-smooth Composite Potentials

Demography of galactic technosignatures

Efficient Greedy Coordinate Descent for Composite Problems

Computation of a 768-Bit Prime Field Discrete Logarithm

On the Discreteness of Transmission Eigenvalues for the Maxwell Equations

Smooth Shapes with Spherical Topology: Beyond Traditional Modeling, Efficient Deformation, and Interaction

Efficient Greedy Coordinate Descent for Composite Problems

Hard criteria for empirical theories of consciousness

Contextualizing the co-creation of artefacts within the nested social structure of a collaborative MOOC