Publications associées à Complexité descriptive

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.

Efficient Continual Finite-Sum Minimization

Volkan Cevher, Efstratios Panteleimon Skoulakis, Leello Tadesse Dadi

Given a sequence of functions

f_1,\ldots,f_n

with

f_i:\mathcal{D}\mapsto \mathbb{R}

, finite-sum minimization seeks a point

{x}^\star \in \mathcal{D}

minimizing

\sum_{j=1}^nf_j(x)/n

. In this work, we propose a key twist into the finite-sum minimizat ...

2024

Complexité descriptive

Graph Chatbot

Chattez avec Graph Search

Efficient Continual Finite-Sum Minimization

A Streamline Upwind Petrov-Galerkin Reduced Order Method for Advection-Dominated Partial Differential Equations Under Optimal Control

Linear Complexity Self-Attention With 3rd Order Polynomials

On Semi-Algebraic Proofs and Algorithms

A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness

Proofs, Circuits, and Communication

A Toolbox for Barriers on Interactive Oracle Proofs

Adversarial training with informed data selection

Relaxed Locally Correctable Codes With Nearly-Linear Block Length And Constant Query Complexity

Complexity analysis of stochastic gradient methods for PDE-constrained optimal control problems with uncertain parameters

Linear Complexity Self-Attention With 3rd Order Polynomials

Complexity analysis of stochastic gradient methods for PDE-constrained optimal control problems with uncertain parameters

Proofs, Circuits, and Communication

Relaxed Locally Correctable Codes With Nearly-Linear Block Length And Constant Query Complexity

A Streamline Upwind Petrov-Galerkin Reduced Order Method for Advection-Dominated Partial Differential Equations Under Optimal Control

On Semi-Algebraic Proofs and Algorithms

Efficient Continual Finite-Sum Minimization

A Toolbox for Barriers on Interactive Oracle Proofs

A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness

Adversarial training with informed data selection