854 citations
- IBM Research - BrazilBR9 papers
- IBM (United States)US4 papers
- The University of MelbourneAU3 papers
- Institut national de recherche en sciences et technologies du numériqueFR2 papers
- Western Sydney UniversityAU2 papers
- Beihang UniversityCN1 paper
- Beth Israel Deaconess Medical CenterUS1 paper
- Cardiff UniversityGB1 paper
- Cleveland State UniversityUS1 paper
- Cracow University of TechnologyPL1 paper
- École Normale Supérieure de LyonFR1 paper
- Eindhoven University of TechnologyNL1 paper
22 papers
Nonstationary Reinforcement Learning with Linear Function Approximation
Huozhi Zhou, Jinglin Chen, Lav R. Varshney +1
We consider reinforcement learning (RL) in episodic Markov decision processes (MDPs) with linear function approximation under drifting environment. Specifically, both the reward an…
A fundamental test for MOND
Valerio Marra, Davi C. Rodrigues, Álefe O. F. de Almeida
The Radial Acceleration Relation (RAR) shows a strong correlation between two accelerations associated to galaxy rotation curves. The relation between these accelerations is given…
Financial storage rights for hydroelectricity
L. S. A. Martins, R. L. Hochstetler
There has recently been growing interest in the development of financial storage rights for energy storage systems as instruments akin to their transmission counterparts as a means…
Benders' decomposition of the unit commitment problem with semidefinite relaxation of AC power flow constraints
M. Paredes, L. S. A. Martins, S. Soares +1
In this paper we present a formulation of the unit commitment problem with AC power flow constraints. It is solved by a Benders decomposition in which the unit commitment master pr…
Wasserstein Barycenter Model Ensembling
Pierre Dognin, Igor Melnyk, Youssef Mroueh +3
In this paper we propose to perform model ensembling in a multiclass or a multilabel learning setting using Wasserstein (W.) barycenters. Optimal transport metrics, such as the Was…
Binary Decision Diagrams for Bin Packing with Minimum Color Fragmentation
David Bergman, Carlos Cardonha, Saharnaz Mehrani
Bin Packing with Minimum Color Fragmentation (BPMCF) is an extension of the Bin Packing Problem in which each item has a size and a color and the goal is to minimize the sum of the…