Publications associées à Coordinate Descent with Bandit Sampling

Publications associées (31)

Vehicle Trajectory Dataset from Drone-Collected Data at Three Swiss Roundabouts

Nikolaos Geroliminis, Emmanouil Barmpounakis, Robert Fonod, Jasso Espadaler Clapés

Overview This dataset provides high-resolution, georeferenced vehicle trajectories collected via drone footage at three roundabouts located in the municipalities of Frick and Laufenburg, Canton of Aargau, Switzerland. The data were collected as part of a ...

Zenodo2025

Convex Computation of Value-at-risk Bounds for Stochastic Processes

Matteo Raphael Tacchi

This article formulates algorithms to upper-bound the maximum value-at-risk (VaR) of a state function along trajectories of stochastic processes. The VaR is upper bounded by two methods: minimax tail-bounds (Cantelli/Vysochanskij-Petunin) and Expected Shor ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2025

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

Planetary-Scale Byzantine Fault Tolerance

Matteo Monti

The scale and pervasiveness of the Internet make it a pillar of planetary communication, industry and economy, as well as a fundamental medium for public discourse and democratic engagement. In stark contrast with the Internet's decentralized infrastructur ...

EPFL2024

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

A geometric optimal control approach for imitation and generalization of manipulation skills

Sylvain Calinon, Amirreza Razmjoo Fard

Daily manipulation tasks are characterized by regular features associated with the task structure, which can be described by multiple geometric primitives related to actions and object shapes. Only using Cartesian coordinate systems cannot fully represent ...

Elsevier2023

Updates on Hydrogen Value Chain: A Strategic Roadmap

Michael Graetzel, Dan Ren

A strategic roadmap for noncarbonized fuels is a global priority, and the reduction of carbon dioxide emissions is a key focus of the Paris Agreement to mitigate the effects of rising temperatures. In this context, hydrogen is a promising noncarbonized fue ...

WILEY-V C H VERLAG GMBH2023

Sensitivity to user mischaracterizations in electric vehicle charging

Nils Gustav Nilsson

In this paper, we consider electric vehicle charging facilities that offer various levels of service, i.e., charging rates, for varying prices such that rational users choose a level of service that minimizes the total cost to themselves including an oppor ...

ELSEVIER2023

Appropriations and Uses of Travel Time

Ludy Juliana González Villamizar

Time has always been a central factor in understanding the challenges of daily mobility. For a long time, and still today, methods of economic evaluation of transport projects have monetized time savings so that they can be included in the cost–benefit ana ...

ISTE Wiley2023

Contextual Stochastic Bilevel Optimization

Daniel Kuhn, Andreas Krause, Yifan Hu

We introduce contextual stochastic bilevel optimization (CSBO) -- a stochastic bilevel optimization framework with the lower-level problem minimizing an expectation conditioned on some contextual information and the upper-level decision variable. This fram ...

2023

Wind farm power density optimization according to the area size using a novel self-adaptive genetic algorithm

Fernando Porté Agel, Nicolas Otto Kirchner Bossi

This work studies the power density (PD) optimization in wind farms, and its sensitivity to the available area size. A novel genetic algorithm (PDGA) is introduced, which optimizes PD and the turbine layout, by self-adapting to the PD and to the solutions ...

Pergamon-Elsevier Science Ltd2023

Hardware-Software co-design Methodologies for Edge AI Optimization

Flavio Ponzina

ML-based edge devices may face memory and computational errors that affect applications' reliability and performance. These errors can be the result of particular working conditions (e.g., radiation areas in physical experiments or avionics) or could be th ...

EPFL2023

Learning Linearized Degradation of Health Indicators using Deep Koopman Operator Approach

Olga Fink, Sergei Garmaev

With the current trend of increasing complexity of industrial systems, the construction and monitoring of health indicators becomes even more challenging. Given that health indicators are commonly employed to predict the end of life, a crucial criterion fo ...

Research Publishing2023

Improving K-means Clustering Using Speculation

Stefan Igescu, Anastasia Ailamaki, Viktor Sanca, Eleni Zapridou

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

Systematic benchmarking of single-cell ATAC-sequencing protocols

Bart Deplancke, Jörn Pezoldt, Camille Lucie Germaine Lambert

Benchmarking of scATAC-seq protocols demonstrates the effects of data quality on downstream analyses. ...

NATURE PORTFOLIO2023

A continuum approximation approach to the depot location problem in a crowd-shipping system

Nikolaos Geroliminis, Patrick Stefan Adriaan Stokkink

Last-mile delivery in the logistics chain contributes to congestion in urban networks due to frequent stops. Crowd-shipping is a sustainable and low-cost alternative to traditional delivery but relies heavily on the availability of occasional couriers. In ...

PERGAMON-ELSEVIER SCIENCE LTD2023

Bernhard Riemann 1861 revisited: existence of flat coordinates for an arbitrary bilinear form

Bernard Dacorogna, Marc Troyanov

We generalize the celebrated results of Bernhard Riemann and Gaston Darboux: we give necessary and sufficient conditions for a bilinear form to be flat. More precisely, we give explicit necessary and sufficient conditions for a tensor field of type (0, 2) ...

Springer Heidelberg2023

A note on universal inference

Anthony Christopher Davison, Timmy Rong Tian Tse

Universal inference enables the construction of confidence intervals and tests without regularity conditions by splitting the data into two parts and appealing to Markov's inequality. Previous investigations have shown that the cost of this generality is a ...

WILEY2022

DatAFLow: Toward a Data-Flow-Guided Fuzzer

Mathias Josef Payer

Coverage-guided greybox fuzzers rely on control-flow coverage feedback to explore a target program and uncover bugs. Compared to control-flow coverage, data-flow coverage offers a more fine-grained approximation of program behavior. Data-flow coverage capt ...

2023

Text Representation Learning for Low Cost Natural Language Understanding

Jan Frederik Jonas Florian Mai

Natural language processing and other artificial intelligence fields have witnessed impressive progress over the past decade. Although some of this progress is due to algorithmic advances in deep learning, the majority has arguably been enabled by scaling ...

EPFL2023