Search Results for author: Philippe Ciblat

Found 9 papers, 0 papers with code

Multi-Objective Decision Transformers for Offline Reinforcement Learning

no code implementations31 Aug 2023 Abdelghani Ghanem, Philippe Ciblat, Mounir Ghogho

Offline Reinforcement Learning (RL) is structured to derive policies from static trajectory data without requiring real-time environment interactions.

D4RL Offline RL +2

Neural network approaches to point lattice decoding

no code implementations13 Dec 2020 Vincent Corlay, Joseph J. Boutros, Philippe Ciblat, Loïc Brunel

It is exponential in the space dimension $n$, which induces shallow neural networks of exponential size.

Cache Updating Strategy Minimizing the Age of Information with Time-Varying Files' Popularities

no code implementations9 Oct 2020 Haoyue Tang, Philippe Ciblat, Jintao Wang, Michele Wigger, Roy D. Yates

Inspired by this solution for the relaxed problem, we propose a practical cache updating strategy that meets all the constraints of the original problem.

Information Theory Information Theory

GraphCL: Contrastive Self-Supervised Learning of Graph Representations

no code implementations15 Jul 2020 Hakim Hafidi, Mounir Ghogho, Philippe Ciblat, Ananthram Swami

We propose Graph Contrastive Learning (GraphCL), a general framework for learning node representations in a self supervised manner.

Contrastive Learning Node Classification +1

Distributed Resource Allocation Algorithms for Multi-Operator Cognitive Communication Systems

no code implementations6 May 2020 Ehsan Tohidi, David Gesbert, Philippe Ciblat

We address the problem of resource allocation (RA) in a cognitive radio (CR) communication system with multiple secondary operators sharing spectrum with an incumbent primary operator.

Distributed Optimization

A lattice-based approach to the expressivity of deep ReLU neural networks

no code implementations28 Feb 2019 Vincent Corlay, Joseph J. Boutros, Philippe Ciblat, Loic Brunel

We prove that they can be computed by ReLU networks with quadratic depth and linear width in the space dimension.

On the CVP for the root lattices via folding with deep ReLU neural networks

no code implementations6 Feb 2019 Vincent Corlay, Joseph J. Boutros, Philippe Ciblat, Loic Brunel

Lattice decoding in Rn, known as the closest vector problem (CVP), becomes a classification problem in the fundamental parallelotope with a piecewise linear function defining the boundary.

General Classification

Cannot find the paper you are looking for? You can Submit a new open access paper.