Zobrazeno 1 - 10
of 220
pro vyhledávání: '"Telle, Jan Arne"'
Autor:
Cebrian, Manuel, Telle, Jan Arne
Attributing outputs from Large Language Models (LLMs) in adversarial settings-such as cyberattacks and disinformation-presents significant challenges that are likely to grow in importance. We investigate this attribution problem using formal language
Externí odkaz:
http://arxiv.org/abs/2411.08003
We study a model of machine teaching where the teacher mapping is constructed from a size function on both concepts and examples. The main question in machine teaching is the minimum number of examples needed for any concept, the so-called teaching d
Externí odkaz:
http://arxiv.org/abs/2402.04907
Autor:
Ferri, Cèsar, Garigliotti, Dario, Håvardstun, Brigt Arve Toppe, Hernández-Orallo, Josè, Telle, Jan Arne
In traditional machine teaching, a teacher wants to teach a concept to a learner, by means of a finite set of examples, the witness set. But concepts can have many equivalent representations. This redundancy strongly affects the search space, to the
Externí odkaz:
http://arxiv.org/abs/2401.12711
Autor:
Simon, Hans Ulrich, Telle, Jan Arne
Imagine a learner L who tries to infer a hidden concept from a collection of observations. Building on the work [4] of Ferri et al., we assume the learner to be parameterized by priors P(c) and by c-conditional likelihoods P(z|c) where c ranges over
Externí odkaz:
http://arxiv.org/abs/2307.05252
Autor:
Le, Van Bang, Telle, Jan Arne
In a graph, a perfect matching cut is an edge cut that is a perfect matching. Perfect Matching Cut (PMC) is the problem of deciding whether a given graph has a perfect matching cut, and is known to be NP-complete. We revisit the problem and show that
Externí odkaz:
http://arxiv.org/abs/2107.06399
A $k$-leaf power of a tree $T$ is a graph $G$ whose vertices are the leaves of $T$ and whose edges connect pairs of leaves whose distance in $T$ is at most $k$. A graph is a leaf power if it is a $k$-leaf power for some $k$. Over 20 years ago, Nishim
Externí odkaz:
http://arxiv.org/abs/2105.12407
The minimum height of vertex and edge partition trees are well-studied graph parameters known as, for instance, vertex and edge ranking number. While they are NP-hard to determine in general, linear-time algorithms exist for trees. Motivated by a cor
Externí odkaz:
http://arxiv.org/abs/2105.12093
An intersection digraph is a digraph where every vertex $v$ is represented by an ordered pair $(S_v, T_v)$ of sets such that there is an edge from $v$ to $w$ if and only if $S_v$ and $T_w$ intersect. An intersection digraph is reflexive if $S_v\cap T
Externí odkaz:
http://arxiv.org/abs/2105.01413
We study the complexity of finding an optimal hierarchical clustering of an unweighted similarity graph under the recently introduced Dasgupta objective function. We introduce a proof technique, called the normalization procedure, that takes any such
Externí odkaz:
http://arxiv.org/abs/2008.03061
The two weighted graph problems Node Multiway Cut (NMC) and Subset Feedback Vertex Set (SFVS) both ask for a vertex set of minimum total weight, that for NMC disconnects a given set of terminals, and for SFVS intersects all cycles containing a vertex
Externí odkaz:
http://arxiv.org/abs/1910.00887