Publications associées à On the conjugate symmetry and sparsity of the harmonic decomposition of parametric surfaces with the randomised Kaczmarz method

Publications associées (14)

The Cost of Consistency: Submodular Maximization with Constant Recourse

In this work, we study online submodular maximization and how the requirement of maintaining a stable solution impacts the approximation. In particular, we seek bounds on the best-possible approximation ratio that is attainable when the algorithm is allowe ...

ACM2025

Graph sparsification, sketching and adaptivity

Mikhail Makarov

Many challenges of modern graph processing stem from the fact that graphs have become massive and change frequently. Numerous techniques have been developed to address those issues, with graph cut sparsification offering to replace original graphs with th ...

EPFL2025

Energy-Aware Decentralized Learning with Intermittent Model Training

Anne-Marie Kermarrec, Rafael Pereira Pires, Rishi Sharma, Marinus Abraham de Vos, Akash Balasaheb Dhasade

SKIPTRAIN is a novel Decentralized Learning (DL) algorithm, which minimizes energy consumption in decentralized learning by strategically skipping some training rounds and substituting them with synchronization rounds. These trainingsilent periods, besides ...

IEEE2024

Hyperdimensional computing with holographic and adaptive encoder

Alejandro Hernández Cano

Introduction: Brain-inspired computing has become an emerging field, where a growing number of works focus on developing algorithms that bring machine learning closer to human brains at the functional level. As one of the promising directions, Hyperdimensi ...

2024

Solving the Tensor Isomorphism Problem for Special Orbits with Low Rank Points: Cryptanalysis and Repair of an Asiacrypt 2023 Commitment Scheme

Laurane Chloé Angélina Marco

The Tensor Isomorphism Problem (TIP) has been shown equivalent to the matrix code equivalence problem, making it an interesting candidate on which to build post-quantum cryptographic primitives. These hard problems have already been used in protocol develo ...

Springer Cham2024

EdgeFace: Efficient Face Recognition Model for Edge Devices

Hatef Otroshi Shahreza

In this paper, we present EdgeFace - a lightweight and efficient face recognition network inspired by the hybrid architecture of EdgeNeXt. By effectively combining the strengths of both CNN and Transformer models, and a low rank linear layer, EdgeFace achi ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2024

Online Network Source Optimization with Graph-Kernel MAB

Pascal Frossard

We propose Grab-UCB, a graph-kernelmulti-arms bandit algorithm to learn online the optimal source placement in large scale networks, such that the reward obtained from a priori unknown network processes is maximized. The uncertainty calls for online learni ...

Springer International Publishing Ag2023

Retraction-based numerical methods for continuation, interpolation and time integration on manifolds

Axel Elie Joseph Séguin

The goal of this thesis is the development and the analysis of numerical methods for problems where the unknown is a curve on a smooth manifold. In particular, the thesis is structured around the three following problems: homotopy continuation, curve inter ...

EPFL2023

Maximum Independent Set: Self-Training through Dynamic Programming

Volkan Cevher, Grigorios Chrysos, Efstratios Panteleimon Skoulakis

This work presents a graph neural network (GNN) framework for solving the maximum independent set (MIS) problem, inspired by dynamic programming (DP). Specifically, given a graph, we propose a DP-like recursive algorithm based on GNNs that firstly construc ...

2023

Distributed Shadow Dynamic Consensus Optimization Framework for Power Market with Parameterization Bidding Strategy of GENCOs

Liying Yu, Sidi-Rachid Cherkaoui

This paper presents a distributed shadow dynamic consensus (DSDC) framework to address the generation company (GENCO) strategic bidding problem in the independent system operator (ISO) operation. First, each sub-group is defined according to the communicat ...

IEEE2023

Optimizing Quantum Compilers: Efficient and Effective Algorithms

Fereshte Mozafari Ghoraba

Quantum computing has made significant progress in recent years, with Google and IBM releasing quantum computers with 72 and 50 qubits, respectively. Google has also achieved quantum supremacy with its 54-qubit device, and IBM has announced the release of ...

EPFL2023

Quantization for Decentralized Learning Under Subspace Constraints

Ali H. Sayed, Stefan Vlaski, Roula Nassif

In this article, we consider decentralized optimization problems where agents have individual cost functions to minimize subject to subspace constraints that require the minimizers across the network to lie in low-dimensional subspaces. This constrained fo ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2023

Solving the Learning Parity with Noise Problem Using Quantum Algorithms

Serge Vaudenay, Bénédikt Minh Dang Tran

The Learning Parity with Noise (LPN) problem is a famous cryptographic problem consisting in recovering a secret from noised samples. This problem is usually solved via reduction techniques, that is, one reduces the original instance to a smaller one befor ...

Springer2022

Practical Compilation of Quantum Programs

Bruno Schmitt Antunes

It's been a little more than 40 years since researchers first suggested exploiting quantum physics to build more powerful computers. During this time, we have seen the development of many quantum algorithms and significant technological advances to make th ...

EPFL2022