Publication

Topology of the Fittest Transportation Network

Publications associées (62)

Fly-Swat or Cannon? Cost-Effective Language Model Choice via Meta-Modeling

Robert West, Maxime Jean Julien Peyrard, Marija Sakota

Generative language models (LMs) have become omnipresent across data science. For a wide variety of tasks, inputs can be phrased as natural language prompts for an LM, from whose output the solution can then be extracted. LM performance has consistently be ...

Assoc Computing Machinery2024

Efficient Online Clustering with Moving Costs

Volkan Cevher, Efstratios Panteleimon Skoulakis

In this work we consider an online learning problem, called Online k-Clustering with Moving Costs, at which a learner maintains a set of k facilities over T rounds so as to minimize the connection cost of an adversarially selected sequence of clients. The ...

2023

Improving K-means Clustering Using Speculation

Anastasia Ailamaki, Viktor Sanca, Eleni Zapridou, Stefan Igescu

K-means is one of the fundamental unsupervised data clustering and machine learning methods. It has been well studied over the years: parallelized, approximated, and optimized for different cases and applications. With increasingly higher parallelism leadi ...

2023

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

Optimal Matching of Random Parts

Thomas Alois Weber

This paper examines the minimization of the cost for an expected random production output, given an assembly of finished goods from two random inputs, matched in two categories. We describe the optimal input portfolio, first using the standard normal appro ...

2022

Cost and benefit allocation in a energy community

In the transition to a sustainable energy system, energy communities have unique advantages; they require no additional land and allow inhabitants to reduce their energy bills. Nowadays, each shareholder’s profit is calculated based on their share of inves ...

2021

Optimal Control Combining Emulation and Imitation to Acquire Physical Assistance Skills

Sylvain Calinon, Amirreza Razmjoo Fard, Teguh Santoso Lembono

paper studies exploiting action-level learning (imitation) in the optimal control problem context. Cost functions defined by the optimal control methods are similar to the goal-level learning (emulation) in animals. However, imitating the robot's or others ...

IEEE2021

Frequency dependence in GW made simple using a multipole approximation

Tommaso Chiarotti, Andrea Ferretti

In the GW approximation, the screened interaction W is a nonlocal and dynamical potential that usually has a complex frequency dependence. A full description of such a dependence is possible but often computationally demanding. For this reason, it is still ...

AMER PHYSICAL SOC2021

Monotonicity in the trip scheduling problem

Nikolaos Geroliminis, Raphael Ali Francis Lamotte

The equilibrium of the archetypal morning commute problem with alpha -,B - gamma preferences has been shown to be unstable with various rational adjustment mechanisms, under both continuous and discrete day-to-day dynamics. It is not clear however whether ...

PERGAMON-ELSEVIER SCIENCE LTD2021

Dynamic carpool in morning commute: Role of high-occupancy-vehicle (HOV) and high-occupancy-toll (HOT) lanes

Kenan Zhang

This study analyzes carpool in morning commute, using a bottleneck model that allocates a fraction of the bottleneck capacity to a high-occupancy-vehicle (HOV) or a high-occupancy-toll (HOT) lane. Commuters are homogeneous cost minimizers who participate c ...

2020

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