Zobrazeno 1 - 10
of 6 233
pro vyhledávání: '"A. Tour"'
Majority Illusion is a phenomenon in social networks wherein the decision by the majority of the network is not the same as one's personal social circle's majority, leading to an incorrect perception of the majority in a large network. In this paper,
Externí odkaz:
http://arxiv.org/abs/2407.20187
Autor:
la Tour, Max Dupré, Saulpic, David
Clustering is one of the staples of data analysis and unsupervised learning. As such, clustering algorithms are often used on massive data sets, and they need to be extremely fast. We focus on the Euclidean $k$-median and $k$-means problems, two of t
Externí odkaz:
http://arxiv.org/abs/2407.11217
A graph $G=(V,E)$ is a $k$-leaf power if there is a tree $T$ whose leaves are the vertices of $G$ with the property that a pair of leaves $u$ and $v$ induce an edge in $G$ if and only if they are distance at most $k$ apart in $T$. For $k\le 4$, it is
Externí odkaz:
http://arxiv.org/abs/2407.02412
We study in this paper the problem of maintaining a solution to $k$-median and $k$-means clustering in a fully dynamic setting. To do so, we present an algorithm to efficiently maintain a coreset, a compressed version of the dataset, that allows easy
Externí odkaz:
http://arxiv.org/abs/2406.19926
As a staple of data analysis and unsupervised learning, the problem of private clustering has been widely studied under various privacy models. Centralized differential privacy is the first of them, and the problem has also been studied for the local
Externí odkaz:
http://arxiv.org/abs/2406.11649
Autor:
Gao, Leo, la Tour, Tom Dupré, Tillman, Henk, Goh, Gabriel, Troll, Rajan, Radford, Alec, Sutskever, Ilya, Leike, Jan, Wu, Jeffrey
Sparse autoencoders provide a promising unsupervised approach for extracting interpretable features from a language model by reconstructing activations from a sparse bottleneck layer. Since language models learn many concepts, autoencoders need to be
Externí odkaz:
http://arxiv.org/abs/2406.04093
We study the computational complexity of the map redistricting problem (gerrymandering). Mathematically, the electoral district designer (gerrymanderer) attempts to partition a weighted graph into $k$ connected components (districts) such that its ca
Externí odkaz:
http://arxiv.org/abs/2312.14721
Autor:
de la Tour, Thierry Boy
Publikováno v:
EPTCS 397, 2023, pp. 20-38
What does it mean for an algebraic rewrite rule to subsume another rule (that may then be called a subrule)? We view subsumptions as rule morphisms such that the simultaneous application of a rule and a subrule (i.e. the application of a subsumption
Externí odkaz:
http://arxiv.org/abs/2312.13294
We consider the problem of clustering privately a dataset in $\mathbb{R}^d$ that undergoes both insertion and deletion of points. Specifically, we give an $\varepsilon$-differentially private clustering mechanism for the $k$-means objective under con
Externí odkaz:
http://arxiv.org/abs/2307.03430
Autor:
Sattari, Kianoosh, Eddy, Lucas, Beckham, Jacob L., Wyss, Kevin M., Byfield, Richard, Qian, Long, Tour, James M., Lin, Jian
Flash Joule heating (FJH) is a far-from-equilibrium (FFE) processing method for converting low-value carbon-based materials to flash graphene (FG). Despite its promise in scalability and performance, attempts to explore the reaction mechanism have be
Externí odkaz:
http://arxiv.org/abs/2303.12638