Concept
Composition de fonctions
Publications associées (63)
Efficient Continual Finite-Sum Minimization
Volkan Cevher, Efstratios Panteleimon Skoulakis, Leello Tadesse Dadi
Given a sequence of functions with , finite-sum minimization seeks a point minimizing . In this work, we propose a key twist into the finite-sum minimizat ...
2024Effect of Matrix Composition and Thermodynamic Properties on Virus Persistence in Respiratory Droplets
Athanasios Nenes, Tamar Kohn, Aline Laetitia Schaub, Shannon Christa David, Laura José Costa Henriques
It is now well-established that respiratory viruses can be transmitted by the airborne route, yet the parameters modulating the infectivity of viruses in aerosol particles are poorly understood. Through a combined experimental and computational approach, w ...
2023A Majority Lemma for Randomised Query Complexity
Mika Tapani Göös, Gilbert Théodore Maystre
We show that computing the majority of n copies of a boolean function g has randomised query complexity R(Maj∘gⁿ) = Θ(n⋅R ̅_{1/n}(g)). In fact, we show that to obtain a similar result for any composed function f∘gⁿ, it suffices to prove a sufficiently stro ...
Schloss Dagstuhl - Leibniz-Zentrum für Informatik2021Learning music composition with recurrent neural networks
Throughout this thesis, we are interested in modeling music composition. To do so, we study the association of music theory concepts with the learning capabilities of recurrent neural networks. Especially, we explore numerical formalizations of music so th ...
EPFL2021The Power of Many Samples in Query Complexity
The randomized query complexity 𝖱(f) of a boolean function f: {0,1}ⁿ → {0,1} is famously characterized (via Yao’s minimax) by the least number of queries needed to distinguish a distribution 𝒟₀ over 0-inputs from a distribution 𝒟₁ over 1-inputs, maximized ...
Schloss Dagstuhl - Leibniz-Zentrum für Informatik2020