Zobrazeno 1 - 10
of 2 973
pro vyhledávání: '"A. Addad"'
Autor:
Chen, Yanfei, Yoon, Jinsung, Sachan, Devendra Singh, Wang, Qingze, Cohen-Addad, Vincent, Bateni, Mohammadhossein, Lee, Chen-Yu, Pfister, Tomas
Recent advances in large language models (LLMs) have enabled autonomous agents with complex reasoning and task-fulfillment capabilities using a wide range of tools. However, effectively identifying the most relevant tools for a given task becomes a k
Externí odkaz:
http://arxiv.org/abs/2408.01875
We study the classic problem of correlation clustering in dynamic node streams. In this setting, nodes are either added or randomly deleted over time, and each node pair is connected by a positive or negative edge. The objective is to continuously fi
Externí odkaz:
http://arxiv.org/abs/2406.09137
We revisit the input perturbations framework for differential privacy where noise is added to the input $A\in \mathcal{S}$ and the result is then projected back to the space of admissible datasets $\mathcal{S}$. Through this framework, we first desig
Externí odkaz:
http://arxiv.org/abs/2406.04868
Graph clustering is a central topic in unsupervised learning with a multitude of practical applications. In recent years, multi-view graph clustering has gained a lot of attention for its applicability to real-world instances where one has access to
Externí odkaz:
http://arxiv.org/abs/2406.04860
We consider the semi-random graph model of [Makarychev, Makarychev and Vijayaraghavan, STOC'12], where, given a random bipartite graph with $\alpha$ edges and an unknown bipartition $(A, B)$ of the vertex set, an adversary can add arbitrary edges ins
Externí odkaz:
http://arxiv.org/abs/2406.04857
Autor:
Li, Pengji, Biesterfeld, Leon, Klepzig, Lars, Yang, Jingzhong, Ngo, Huu Thoai, Addad, Ahmed, Rakow, Tom N., Guan, Ruolin, Rugeramigabo, Eddy P., Zaluzhnyy, Ivan, Schreiber, Frank, Biadala, Louis, Lauth, Jannika, Zopf, Michael
Colloidal semiconductor nanocrystals are promising materials for classical and quantum light sources due to their versatile chemistry and efficient photoluminescence (PL) properties. While visible emitters are well-established, the pursuit of excelle
Externí odkaz:
http://arxiv.org/abs/2405.19821
Coresets are arguably the most popular compression paradigm for center-based clustering objectives such as $k$-means. Given a point set $P$, a coreset $\Omega$ is a small, weighted summary that preserves the cost of all candidate solutions $S$ up to
Externí odkaz:
http://arxiv.org/abs/2405.01339
In the classic Correlation Clustering problem introduced by Bansal, Blum, and Chawla~(FOCS 2002), the input is a complete graph where edges are labeled either $+$ or $-$, and the goal is to find a partition of the vertices that minimizes the sum of t
Externí odkaz:
http://arxiv.org/abs/2404.17509
We study the classic correlation clustering in the dynamic setting. Given $n$ objects and a complete labeling of the object-pairs as either similar or dissimilar, the goal is to partition the objects into arbitrarily many clusters while minimizing di
Externí odkaz:
http://arxiv.org/abs/2404.06797
Autor:
Cohen-Addad, Vincent, Lolck, David Rasmussen, Pilipczuk, Marcin, Thorup, Mikkel, Yan, Shuyi, Zhang, Hanwen
Correlation Clustering is a classic clustering objective arising in numerous machine learning and data mining applications. Given a graph $G=(V,E)$, the goal is to partition the vertex set into clusters so as to minimize the number of edges between c
Externí odkaz:
http://arxiv.org/abs/2404.05433