Publications associées à Optimisation combinatoire

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.

Proximal Point Imitation Learning

Volkan Cevher, Luca Viano, Igor Krawczuk, Angeliki Kamoutsi

This work develops new algorithms with rigorous efficiency guarantees for infinite horizon imitation learning (IL) with linear function approximation without restrictive coherence assumptions. We begin with the minimax formulation of the problem and then o ...

2022

On the advantages of P2P ML on mobile devices

Rachid Guerraoui, Alexandre David Olivier Maurer

Many fields make use nowadays of machine learning (ML) enhanced applications for cost optimization, scheduling or forecasting, in- cluding the energy sector. However, these very ML algorithms consume a significant amount of energy, sometimes going against ...

ACM2022

Binary Perceptron: Efficient Algorithms Can Find Solutions in a RareWell-Connected Cluster

Emmanuel Abbé

It was recently shown that almost all solutions in the symmetric binary perceptron are isolated, even at low constraint densities, suggesting that finding typical solutions is hard. In contrast, some algorithms have been shown empirically to succeed in fin ...

ASSOC COMPUTING MACHINERY2022

Modeling and mitigating supply chain disruptions as a bilevel network flow problem

Anna Timonina-Farkas, René Yves Glogg

Years of globalization, outsourcing and cost cutting have increased supply chain vulnerability calling for more effective risk mitigation strategies. In our research, we analyze supply chain disruptions in a production setting. Using a bilevel optimization ...

SPRINGER HEIDELBERG2022

Towards Understanding Sharpness-Aware Minimization

Nicolas Henri Bernard Flammarion, Maksym Andriushchenko

Sharpness-Aware Minimization (SAM) is a recent training method that relies on worst-case weight perturbations which significantly improves generalization in various settings. We argue that the existing justifications for the success of SAM which are based ...

JMLR-JOURNAL MACHINE LEARNING RESEARCH2022

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

Rachid Guerraoui, Jovan Komatovic, Pierre Philippe Civit, Vincent Gramoli, Seth Gilbert

It is known that the agreement property of the Byzantine consensus problem among n processes can be violated in a non-synchronous system if the number of faulty processes exceeds t0 = ┌n/3┐ − 1 [10], [19]. In this paper, we investigate the accountable Byza ...

IEEE2022

Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost

Adam Teodor Polak

We study the basic problem of assigning memoryless workers to tasks with dynamically changing demands. Given a set of w workers and a multiset T ⊆ [t] of |T| = w tasks, a memoryless worker-task assignment function is any function ϕ that assigns the workers ...

Schloss Dagstuhl -- Leibniz-Zentrum fur Informatik2022

Detailed Placement for Dedicated LUT-Level FPGA Interconnect

Paolo Ienne, Grace Zgheib, Stefan Nikolic

In this work, we develop timing-driven CAD support for FPGA architectures with direct connections between LUTs. We do so by proposing an efficient ILP-based detailed placer, which moves a carefully selected subset of LUTs from their original positions, so ...

ASSOC COMPUTING MACHINERY2022

Optimisation combinatoire

Graph Chatbot

Chattez avec Graph Search

Optimal Matching of Random Parts

Proximal Point Imitation Learning

On the advantages of P2P ML on mobile devices

Binary Perceptron: Efficient Algorithms Can Find Solutions in a RareWell-Connected Cluster

Modeling and mitigating supply chain disruptions as a bilevel network flow problem

Towards Understanding Sharpness-Aware Minimization

Tensor network investigation of frustrated Ising models

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost

Detailed Placement for Dedicated LUT-Level FPGA Interconnect

Binary Perceptron: Efficient Algorithms Can Find Solutions in a RareWell-Connected Cluster

Optimal Matching of Random Parts

On the advantages of P2P ML on mobile devices

Tensor network investigation of frustrated Ising models

Detailed Placement for Dedicated LUT-Level FPGA Interconnect

Modeling and mitigating supply chain disruptions as a bilevel network flow problem

Towards Understanding Sharpness-Aware Minimization

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost

Proximal Point Imitation Learning