Teacher-Researcher
AAC
Algorithms, Learning and Computation
The main research axes of the department concern computational models and their robustness (from high-performance computing to quantum computing, including neural networks and distributed algorithms), processing architectures (graphs, distributed, synchronous or asynchronous processing), and methods (e.g., continuous, combinatorial, stochastic optimization; statistical learning and information theory). By construction, these research axes are the subject of collaborations with other departments, in particular Data Science and Fluid Mechanics-Energetics. The analysis and design of models and processes rely heavily on mathematical approaches (discrete and continuous, including probability, statistics and combinatorics) and statistical physics (in particular on the phase transition phenomena of complex systems), in conjunction with the LMO and CMAP (Maths and Maths. Appli), IJCLab (Physics), L2S (Signal Processing), as well as the LIX and the future LMF (Formal Methods) teams
Application areas include scientific computing (e.g., linear algebra, tensor calculus, numerical optimization, dynamical systems, simulation of quantum algorithms, computational mathematics and physics, systems of differential equations), distributed computing (e.g., cloud, scheduling, virtual currency, ubiquitous computing, autonomous robots, microbiological circuits), and data analysis.
Coordination
News
-
Algorithmes Apprentissage et Calcul, Data Sciences
Prix de la meilleure contribution scientifique en STIC du plateau de Saclay 2022 attribué à Herilalaina Rakotoarison
Latest publications
-
Thèse
Valentin Dardilhac. Vote mechanisms and solution of inequation systems with real variables. Computational Complexity [cs.CC]. Université Paris-Saclay, 2025. English. ⟨NNT : 2025UPASG045⟩. ⟨tel-05300167⟩
-
Communication dans un congrès
Pierre Fraigniaud, Minh Hang Nguyen, AmiArchitectures et modèles pour l'Interaction Paz. Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structure. 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025), Mar 2025, Jena, Germany. ⟨10.4230/LIPIcs.STACS.2025.34⟩. ⟨hal-05249104⟩
-
Communication dans un congrès
Atte Torri, Przemysław Dominikowski, Brice Pointal, Oguz Kaya, Laércio Lima Pilla, et al.. Near-Optimal Contraction Strategies for the Scalar Product in the Tensor-Train Format. Euro-Par 2025 – 31 International European Conference on Parallel and Distributed Computing, Aug 2025, Dresden, Germany. pp.63-77, ⟨10.1007/978-3-031-99872-0_5⟩. ⟨hal-05285400⟩
-
Proceedings/Recueil des communications
Quentin Delamea, Janna Burman, Jerome Gurhem, Mohamed Khairallah, Wilfried Kirschenmann, et al.. Cloud-Agnostic Serverless Platform for Fault-Tolerant Execution of Dynamic Task Graphs. 2025 IEEE Cloud Summit, Jun 2025, Washington DC, United States. IEEE, pp.39-45, 2025, ⟨10.1109/Cloud-Summit64795.2025.00014⟩. ⟨hal-05265233⟩
-
Communication dans un congrès
Johanne Cohen, Emmanuel Goutierre, Hayg Guler, Fatios Kapotos, Sida-Bastien Li, et al.. Modelling Dynamical Systems: Learning ODEs with No Internal ODE Resolution. 18th International Conference, RP 2024, Sep 2025, Vienne, Austria. pp.221-237, ⟨10.1007/978-3-031-72621-7_15⟩. ⟨hal-05240753⟩
-
Article dans une revue
Tianjiao Dai, Qiancheng Ouyang, François Pirot. New Bounds for Odd Colourings of Graphs. The Electronic Journal of Combinatorics, 2024, 31 (4), pp.P4.57. ⟨10.37236/12110⟩. ⟨hal-05246159⟩
-
Proceedings/Recueil des communications
Olivier Bournez, Johanne Cohen, Adrian Wurm. A Universal Uniform Approximation Theorem for Neural Networks. 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025), Aug 2025, Varsovie, Poland. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025, ⟨10.4230/LIPIcs.MFCS.2025.29⟩. ⟨hal-05241833⟩
-
Communication dans un congrès
Nicolas Atienza, Johanne Cohen, Christophe Labreuche, Michele Sebag. Provably Safeguarding a Classifier from OOD and Adversarial Samples. 13th International Conference on Learning Representations – ICLR 2025, Apr 2025, Singapore, Singapore. pp.56800-56820. ⟨hal-05241867⟩
-
Thèse
Manon Blanc. Discrete-Time and Continuous-Time Systems over the Reals : Relating Complexity with Robustness, Length and Precision. Computational Complexity [cs.CC]. Institut Polytechnique de Paris, 2025. English. ⟨NNT : 2025IPPAX024⟩. ⟨tel-05118950⟩
-
Communication dans un congrès
Adnan Vora, Mikhail Nesterenko, Sébastien Tixeuil, Sylvie Delaët. Universe Detectors for Sybil Defense in Ad Hoc Wireles Networks. International Conference on Stabilization, Safety, and Security (SSS 2008), Nov 2008, Detroit, MI, United States. pp.63-78, ⟨10.1007/978-3-540-89335-6_8⟩. ⟨hal-01303007⟩
-
Article dans une revue
Amanda Pelegrin Candemil, Hugo Gabrielidis, Filippo Gatti, Benjamin Salmon, Matheus Oliveira, et al.. Diagnostic performance of artefact-reduced cone-beam CT images using a generative adversarial neural network. Expert Systems with Applications, In press, 296 (Part B), pp.128907. ⟨10.1016/j.eswa.2025.128907⟩. ⟨hal-05157692⟩
-
Thèse
Nicolas Atienza. Towards Reliable ML : Leveraging Multi-Modal Representations, Information Bottleneck and Extreme Value Theory. Machine Learning [stat.ML]. Université Paris-Saclay, 2025. English. ⟨NNT : 2025UPASG025⟩. ⟨tel-05140441⟩
-
Communication dans un congrès
Manon Blanc, Olivier Bournez. Quantifiying the robustness of dynamical systems. Relating time and space to length and precision. Computer Science Logic CSL’24, Feb 2024, Naples, Italy. pp.17:1-17:20, ⟨10.4230/lipics.csl.2024.17⟩. ⟨hal-04303119⟩
-
Communication dans un congrès
Djamel Eddine Amir, Benjamin Hellouin de Menibus. Minimality and computability of languages of G-shifts. ICALP 2025, Aarhus University, Jul 2025, Aarhus, Denmark. ⟨hal-05117426⟩
-
Article dans une revue
Pierre Fraigniaud, AmiArchitectures et modèles pour l'Interaction Paz, Sergio Rajsbaum. A speedup theorem for asynchronous computation with applications to consensus and approximate agreement. Distributed Computing, 2025, 38, pp.163-183. ⟨10.1007/s00446-025-00480-0⟩. ⟨hal-05114147⟩
-
Pré-publication, Document de travail
Gabrielidis Hugo, Filippo Gatti, Vialle Stephane. Physics-Based Super-Resolved Simulation of 3D Elastic Wave Propagation Adopting Scalable Diffusion Transformer. 2025. ⟨hal-05044913⟩
-
Logiciel
Pierre Thomas Froidevaux, Alexandre Blondin-Massé, Chiara Marmo, Jérémy Neveu, Jean Privat, et al.. Travo. 2025, ⟨swh:1:dir:25c53be9cb372dca46dc311c114c9d961127225b;origin=https://gitlab.com/travo-cr/travo;visit=swh:1:snp:5f0faa62d3619f576a8a041c609ac66820f54a80;anchor=swh:1:rev:fd9302aab27cb93dc1ef24b3ab13a3da163564ca⟩. ⟨hal-05030605⟩
-
Communication dans un congrès, Communication dans un congrès
Felipe Furquim, Valentin Dardilhac, Daniel Cordeiro, Johanne Cohen. Characterizing Strategyproofness Through Score Functions in Voting Mechanisms. Frontiers of Algorithmics (IJTCS-FAW 2025), Jun 2025, Paris, France. pp.279-292, ⟨10.1007/978-981-96-8312-3_21⟩. ⟨hal-05040764⟩
-
Article dans une revue, Article dans une revue
Julien Rauch, Damien Rontani, Stéphane Vialle. Data clustering on hybrid classical-quantum NISQ architecture with generative-based variational and parallel algorithms. Journal of Systems Architecture, In press, Special Issue on Architecture of Computing Systems Conference 2024, 165, pp.103431. ⟨10.1016/j.sysarc.2025.103431⟩. ⟨hal-05040633⟩
-
Article dans une revue, Article dans une revue
Guanlin He, Stéphane Vialle, Marc Baboulin. Generating Sparse Matrices for Large-scale Spectral Clustering on a Single GPU. International Journal of Parallel Programming, In press, 53 (4), pp.22. ⟨10.1007/s10766-025-00799-y⟩. ⟨hal-05040711⟩
-
Pré-publication, Document de travail
Benjamin Hellouin de Menibus, Ville Salo, Ilkka Törmä. Symbol Frequencies in Surjective Cellular Automata. 2025. ⟨hal-05026614⟩
-
Pré-publication, Document de travail
Niccolò Perrone, Fanny Lehmann, Hugo Gabrielidis, Stefania Fresca, Filippo Gatti. Integrating Fourier Neural Operators with Diffusion Models to improve Spectral Representation of Synthetic Earthquake Ground Motion Response. 2025. ⟨hal-05016980⟩
-
Thèse
Fabricio Cravo. Design of Distributed Biological Circuits. Bioinformatics [q-bio.QM]. Université Paris-Saclay, 2024. English. ⟨NNT : 2024UPASG059⟩. ⟨tel-05007253⟩
-
Pré-publication, Document de travail
Marc Baboulin, Oguz Kaya, Theo Mary, Matthieu Robeyns. Numerical stability of tree tensor network operations, and a stable rounding algorithm. 2025. ⟨hal-04996127⟩
-
Thèse
Emmanuel Goutierre. Machine learning-based particle accelerator modeling. Artificial Intelligence [cs.AI]. Université Paris-Saclay, 2024. English. ⟨NNT : 2024UPASG106⟩. ⟨tel-04995631⟩
-
Pré-publication, Document de travail
Christophe Hohlweg, Viviane Pons. A conjecture on descents, inversions and the weak order. 2025. ⟨hal-04966542⟩
-
Communication dans un congrès
Benjamin Hellouin de Menibus, Pacôme Perrotin. Subshifts Defined by Nondeterministic and Alternating Plane-walking Automata. 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025), Mar 2025, Iena, Germany. pp.56, ⟨10.4230/LIPIcs.STACS.2025.56⟩. ⟨hal-04951292⟩
-
Pré-publication, Document de travail
Alex B. Grilo, AmiArchitectures et modèles pour l'Interaction Paz, Mor Perry. Distributed Non-Interactive Zero-Knowledge Proofs. 2025. ⟨hal-04942069⟩
-
Communication dans un congrès
Nicolas Atienza, Christophe Labreuche, Johanne Cohen, Michèle Sebag. Provably Safeguarding a Classifier from OOD and Adversarial Samples: an Extreme Value Theory Approach. 13th International Conference on Learning Representations – ICLR 2025, Apr 2025, Singapore, Singapore. ⟨hal-04922382⟩
-
Pré-publication, Document de travail
Jean-Philippe Chancelier, Michel de Lara, Antoine Deza, Lionel Pournin. Geometry of Sparsity-Inducing Norms. 2025. ⟨hal-04886852⟩