Zobrazeno 1 - 10
of 125
pro vyhledávání: '"Grossglauser, Matthias"'
The metric backbone of a weighted graph is the union of all-pairs shortest paths. It is obtained by removing all edges $(u,v)$ that are not the shortest path between $u$ and $v$. In networks with well-separated communities, the metric backbone tends
Externí odkaz:
http://arxiv.org/abs/2406.03852
The s-ID problem seeks to compute a causal effect in a specific sub-population from the observational data pertaining to the same sub population (Abouei et al., 2023). This problem has been addressed when all the variables in the system are observabl
Externí odkaz:
http://arxiv.org/abs/2405.14547
Clustering is a pivotal challenge in unsupervised machine learning and is often investigated through the lens of mixture models. The optimal error rate for recovering cluster labels in Gaussian and sub-Gaussian mixture models involves ad hoc signal-t
Externí odkaz:
http://arxiv.org/abs/2402.15432
Policy gradient (PG) is widely used in reinforcement learning due to its scalability and good performance. In recent years, several variance-reduced PG methods have been proposed with a theoretical guarantee of converging to an approximate first-orde
Externí odkaz:
http://arxiv.org/abs/2311.08914
Autor:
Suresh, Aswin, Radojevic, Lazar, Salvi, Francesco, Magron, Antoine, Kristof, Victor, Grossglauser, Matthias
We present a method based on natural language processing (NLP), for studying the influence of interest groups (lobbies) in the law-making process in the European Parliament (EP). We collect and analyze novel datasets of lobbies' position papers and s
Externí odkaz:
http://arxiv.org/abs/2309.11381
We propose an interpretable model to score the bias present in web documents, based only on their textual content. Our model incorporates assumptions reminiscent of the Bradley-Terry axioms and is trained on pairs of revisions of the same Wikipedia a
Externí odkaz:
http://arxiv.org/abs/2307.08139
A comparison-based search algorithm lets a user find a target item $t$ in a database by answering queries of the form, ``Which of items $i$ and $j$ is closer to $t$?'' Instead of formulating an explicit query (such as one or several keywords), the us
Externí odkaz:
http://arxiv.org/abs/2306.01814
Hierarchical clustering of networks consists in finding a tree of communities, such that lower levels of the hierarchy reveal finer-grained community structures. There are two main classes of algorithms tackling this problem. Divisive ($\textit{top-d
Externí odkaz:
http://arxiv.org/abs/2306.00833
Most approaches in few-shot learning rely on costly annotated data related to the goal task domain during (pre-)training. Recently, unsupervised meta-learning methods have exchanged the annotation requirement for a reduction in few-shot classificatio
Externí odkaz:
http://arxiv.org/abs/2006.11325
Autor:
Kristof, Victor, Quelquejay-Leclère, Valentin, Zbinden, Robin, Maystre, Lucas, Grossglauser, Matthias, Thiran, Patrick
We propose a statistical model to understand people's perception of their carbon footprint. Driven by the observation that few people think of CO2 impact in absolute terms, we design a system to probe people's perception from simple pairwise comparis
Externí odkaz:
http://arxiv.org/abs/1911.11658