IRIF
IRIF
  • 34
  • 5 346
Probability and machine learning - Francis Bach (ENS Paris)
Probability and machine learning -- Francis Bach (ENS Paris)
The relationships between probability and machine learning go both ways. In one direction, the classical statistical formulation through random data is probabilistic, but it goes further, with randomness used to speed-up algorithms, e.g., through stochastic gradient descent. More recently, machine learning has been used to propose new frameworks for classical probabilistic tasks such as sampling by denoising. In this talk, I will present an overview of recent advances.
____________________
In the context of the "Probabilities in Theoretical Computer Science" Year 2023-24 of GDR IFM, a one-day conference who took place in 2024 at the IHP. The event featured seven invited talks.
มุมมอง: 44

วีดีโอ

Modern mixing, spatial and temporal - Mark Jerrum (Queen Mary, University of London)
มุมมอง 247 ชั่วโมงที่ผ่านมา
Modern mixing, spatial and temporal The last five years have seen a revolution in the analysis of the mixing time (i.e., the time required to converge to near-equilibrium) of Markov chains. It is now possible to prove optimal upper bounds on mixing time for a wide variety of Markov chains, including many arising in statistical physics and theoretical computer science. In some instances, no sub-...
How Probability Helped Achieve Ultra-Efficient Algorithms for Pattern Matching-Tatiana Starikovskaya
มุมมอง 497 ชั่วโมงที่ผ่านมา
How Probability Helped Achieve Ultra-Efficient Algorithms for Pattern Matching In the fundamental problem of pattern matching, one is given two strings, usually referred to as a pattern and a text, and must decide whether the pattern appears as a substring of the text. In 1970, Knuth, Morris, and Pratt gave the first linear-time and linear-space algorithm for pattern matching. One can argue tha...
Constant-Cost Randomised Communication - Mika Göös (EPFL Lausanne)
มุมมอง 537 ชั่วโมงที่ผ่านมา
Constant-Cost Randomised Communication - Mika Göös (EPFL Lausanne) Some of the most extreme examples of the power of randomness in computing come from communication complexity, where shared randomness can allow two parties to solve non-trivial problems with communication cost independent of the input size. The textbook example is the Equality problem, where two parties hold n-bit strings x and ...
Using Rényi divergence in lattice-based cryptography - Adeline Roux-Langlois (GREYC Caen)
มุมมอง 277 ชั่วโมงที่ผ่านมา
Using Rényi divergence in lattice-based cryptography Lattice-based cryptography is a very interesting candidate to obtain constructions which resist attacks using a quantum computer. Even if powerful enough quantum computers do not exist yet, it is necessary to be prepared and anticipate their arrival. In this talk, I will introduce lattice-based cryptography and some use of the Rényi divergenc...
Omer Reingold (Stanford) Talk - Irif's Distinguished Talk Series
มุมมอง 442 หลายเดือนก่อน
On May 14, 2024 IRIF welcomed Omer Reingold (Stanford) for a talk about " The multitude of group affiliations: Algorithmic Fairness, Loss Minimization and Outcome Indistinguishability" Abstract: We will survey a rather recent and very fruitful line of research in algorithmic fairness, coined multi-group fairness. We will focus on risk prediction, where a machine learning algorithm tries to lear...
Narratives: Shaping the Evolution of Social Networks and the Concept of Time - Part 2 (Zvi Lotker)
มุมมอง 275 หลายเดือนก่อน
Part 1: th-cam.com/video/siv-dXviMqA/w-d-xo.html The mini-course explores the way time flows in dynamic social networks. We will use subjective clocks to open a window to the human soul. The course will cover the second part of my book Analyzing Narratives in Social Networks (link.springer.com/book/10.1007/978-3-030-68299-6). In the first lecture, we will cover chapters 11, 12, and 13. In the s...
Narratives: Shaping the Evolution of Social Networks and the Concept of Time - Part 1 (Zvi Lotker)
มุมมอง 235 หลายเดือนก่อน
Part 2: th-cam.com/video/gw-WaIfoV-g/w-d-xo.html The mini-course explores the way time flows in dynamic social networks. We will use subjective clocks to open a window to the human soul. The course will cover the second part of my book Analyzing Narratives in Social Networks (link.springer.com/book/10.1007/978-3-030-68299-6). In the first lecture, we will cover chapters 11, 12, and 13. In the s...
Véronique Cortier (LORIA) Talk - Irif's Dinstinguished Talk Series
มุมมอง 596 หลายเดือนก่อน
On February 7, 2024 IRIF welcomed Véronique Cortier (Laboratoire lorrain de recherche en informatique et ses applications (LORIA)) for a talk about "Electronic voting: design and formal verification". ABSTRACT "Electronic voting aims at guaranteeing apparently conflicting properties: no one should know how I voted and yet, I should be able to check that my vote has been properly counted. Electr...
Blaise Pascal Quantum Challenge - Frédéric Magniez
มุมมอง 1129 หลายเดือนก่อน
To mark the quadricentennial of the birth of the French mathematician Blaise Pascal, the company PASQAL organised « The Blaise Pascal [re]Generative Quantum Challenge » from 5th October to 15th of November. For this virtual hackaton, a very prestigious jury was reunited and chaired by François Ménégaux, CEO of Michelin. Among those jury, Frédéric Magniez, (CNRS) director at IRIF and professor a...
Simon Peyton Jones (Epic Games) Talk - IRIF's Distinguished Talk Series
มุมมอง 74910 หลายเดือนก่อน
On November 8, 2023 IRIF welcomed Simon Peyton Jones (Epic Games) for a talk about "Beyond functional programming: the Verse programming language". Since joining Epic Games in late 2021, Simon Peyton Jones has been involved in the design and development of Verse, a new, declarative programming language that Epic plans to use as the language of the metaverse. Verse is extremely ambitious: they w...
Conférence “Manuel de Cryptanalyse à l’usage de la NSA”
มุมมอง 156ปีที่แล้ว
À travers l'histoire de la cryptologie, on retrouve les guerres et les complots, mais surtout l'évolution des techniques et des sciences. Ainsi, les codes simplistes de l'Antiquité ont cédé leur place à des méthodes mathématiques assez robustes pour résister aux attaques informatiques. Cette conférence ludique, présentée par Sylvain Perifel - Maître de conférences (Université Paris Cité/IRIF) à...
Quantum Speed-ups for String Synchronizing Sets and Longest Common Substring (Ce Jin)
มุมมอง 108ปีที่แล้ว
Longest Common Substring (LCS) is an important text processing problem, which has recently been investigated in the quantum query model. The decisional version of this problem, LCS with threshold d, asks whether two length-n input strings have a common substring of length d. The two extreme cases, d = 1 and d = n, correspond respectively to Element Distinctness and Unstructured Search, two fund...
On the (in)security of ROS (Michele Orrù)
มุมมอง 3082 ปีที่แล้ว
We present an algorithm solving the ROS (Random inhomogeneities in an Overdetermined Solvable system of linear equations) problem in polynomial time for l larger than log(p) dimensions. Our algorithm can be combined with Wagner’s attack, and leads to a sub-exponential solution for any dimension l with best complexity known so far. When concurrent executions are allowed, our algorithm leads to p...
Nonlocal Games, Compression Theorems, and the Arithmetical Hierarchy (Hamoon Mousavi)
มุมมอง 902 ปีที่แล้ว
Nonlocal Games, Compression Theorems, and the Arithmetical Hierarchy (Hamoon Mousavi)
Memory Compression with Quantum Random-Access Gates (Subhasree Patro)
มุมมอง 1722 ปีที่แล้ว
Memory Compression with Quantum Random-Access Gates (Subhasree Patro)
Multivariate quantum Monte Carlo Estimation (Arjan Cornelissen)
มุมมอง 902 ปีที่แล้ว
Multivariate quantum Monte Carlo Estimation (Arjan Cornelissen)
Almost linear time algorithms for max-flow and more (Sushant Sachdeva)
มุมมอง 4472 ปีที่แล้ว
Almost linear time algorithms for max-flow and more (Sushant Sachdeva)
Nicolas JEANNEROD | PhD defence
มุมมอง 272 ปีที่แล้ว
Nicolas JEANNEROD | PhD defence
Victor LANVIN | PhD defense
มุมมอง 422 ปีที่แล้ว
Victor LANVIN | PhD defense
Quantum Fine-Grained Complexity (Subhasree Patro)
มุมมอง 833 ปีที่แล้ว
Quantum Fine-Grained Complexity (Subhasree Patro)
Decomposable Submodular Function Minimization via Maximum Flow (Kyriakos Axiotis)
มุมมอง 1123 ปีที่แล้ว
Decomposable Submodular Function Minimization via Maximum Flow (Kyriakos Axiotis)
Distance Oracles and Labeling Schemes for Planar Graphs (Paweł Gawrychowski)
มุมมอง 1863 ปีที่แล้ว
Distance Oracles and Labeling Schemes for Planar Graphs (Paweł Gawrychowski)
A New Coreset Framework for Clustering (David Saulpic)
มุมมอง 3493 ปีที่แล้ว
A New Coreset Framework for Clustering (David Saulpic)
Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs (Adrian Vladu)
มุมมอง 1133 ปีที่แล้ว
Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs (Adrian Vladu)
Beating Two-Thirds For Random-Order Streaming Matching (Soheil Behnezhad)
มุมมอง 2303 ปีที่แล้ว
Beating Two-Thirds For Random-Order Streaming Matching (Soheil Behnezhad)
What Limits the Simulation of Quantum Computers? (Xavier Waintal)
มุมมอง 1603 ปีที่แล้ว
What Limits the Simulation of Quantum Computers? (Xavier Waintal)
Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graph Streams (Christian Konrad)
มุมมอง 963 ปีที่แล้ว
Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graph Streams (Christian Konrad)
Switching lemmas in the 80ies and today (Johan Håstad)
มุมมอง 4783 ปีที่แล้ว
Switching lemmas in the 80ies and today (Johan Håstad)
Adaptive ShiversSort - A new sorting algorithm (Vincent Jugé)
มุมมอง 2593 ปีที่แล้ว
Adaptive ShiversSort - A new sorting algorithm (Vincent Jugé)