Tootfinder

Cleaning Up: Leadership in an Age of Climate Change: Audioblog 15: The Pragmatic Climate Reset Part 1 — The Energy Transition Is Not Dead
https://cleaning-up-leadership-in-the-age-of-climate-change.simplecast.com/episodes/the-pragmatic-climate-reset-the-energy-transition-is-not-dead-audioblog-15-6XaNX6zu

FaST: Feature-aware Sampling and Tuning for Personalized Preference Alignment with Limited Data
Thibaut Thonet, Germ\'an Kruszewski, Jos Rozen, Pierre Erbacher, Marc Dymetman
https://arxiv.org/abs/2508.04698

FaST: Feature-aware Sampling and Tuning for Personalized Preference Alignment with Limited Data
LLM-powered conversational assistants are often deployed in a one-size-fits-all manner, which fails to accommodate individual user preferences. Recently, LLM personalization -- tailoring models to align with specific user preferences -- has gained increasing attention as a way to bridge this gap. In this work, we specifically focus on a practical yet challenging setting where only a small set of preference annotations can be collected per user -- a problem we define as Personalized Preference A…

On Improvement of Control Chart using Repetitive Sampling for Monitoring Process Mean
Fahad Rafique, Saadia Masood, Shabbir Ahmad, Sadaf Amin
https://arxiv.org/abs/2510.05086 ht…

On Improvement of Control Chart using Repetitive Sampling for Monitoring Process Mean
In the practical industry, the most commonly used application of statistical analysis for monitoring the process mean is the control chart. Control charts are generated based on the presumption that we have a sample from a stable process. The control chart then provides a graphical display to test this presumption. In the existing estimator \textcolor{red}{$Mr$}, researchers use a technique involving repetitive sampling along with an auxiliary variable for detecting and monitoring the statistic…

Self-Speculative Masked Diffusions
Andrew Campbell, Valentin De Bortoli, Jiaxin Shi, Arnaud Doucet
https://arxiv.org/abs/2510.03929 https://arxiv.org/pdf/2…

Self-Speculative Masked Diffusions
We present self-speculative masked diffusions, a new class of masked diffusion generative models for discrete data that require significantly fewer function evaluations to generate samples. Standard masked diffusion models predict factorized logits over currently masked positions. A number of masked positions are then sampled, however, the factorization approximation means that sampling too many positions in one go leads to poor sample quality. As a result, many simulation steps and therefore n…

Simple totally disconnected locally compact groups separated by finiteness properties
Laura Bonn, Sebastian Giersbach
https://arxiv.org/abs/2509.05101 https://

Simple totally disconnected locally compact groups separated by finiteness properties
We construct a sequence of simple non-discrete totally disconnected locally compact (tdlc) groups separated by finiteness properties; that is, for every positive integer $n$ there exists a simple non-discrete tdlc group that is of type $F_{n-1}$ but not of type $FP_n$. This generalizes a result of Skipper--Witzel--Zaremsky for discrete groups. Furthermore, we construct a simple non-discrete tdlc group that is of type $FP_2$ but not compactly presented. Our examples arise as Smith groups $\mathc…

On the Learnability of Distribution Classes with Adaptive Adversaries
Tosca Lechner, Alex Bie, Gautam Kamath
https://arxiv.org/abs/2509.05137 https://arxiv…

On the Learnability of Distribution Classes with Adaptive Adversaries
We consider the question of learnability of distribution classes in the presence of adaptive adversaries -- that is, adversaries capable of intercepting the samples requested by a learner and applying manipulations with full knowledge of the samples before passing it on to the learner. This stands in contrast to oblivious adversaries, who can only modify the underlying distribution the samples come from but not their i.i.d.\ nature. We formulate a general notion of learnability with respect to …

LUIVITON: Learned Universal Interoperable VIrtual Try-ON
Cong Cao, Xianhang Cheng, Jingyuan Liu, Yujian Zheng, Zhenhui Lin, Meriem Chkir, Hao Li
https://arxiv.org/abs/2509.05030

LUIVITON: Learned Universal Interoperable VIrtual Try-ON
We present LUIVITON, an end-to-end system for fully automated virtual try-on, capable of draping complex, multi-layer clothing onto diverse and arbitrarily posed humanoid characters. To address the challenge of aligning complex garments with arbitrary and highly diverse body shapes, we use SMPL as a proxy representation and separate the clothing-to-body draping problem into two correspondence tasks: 1) clothing-to-SMPL and 2) body-to-SMPL correspondence, where each has its unique challenges. Wh…

copenhagen: Copenhagen Networks Study
A network of social interactions among university students within the Copenhagen Networks Study, over a period of four weeks, sampled every 5 minutes. Interactions include physical proximity (undirected), phone calls (directed, weighted), text messages (directed), and information about Facebook friendships (undirected). Nodes include some metadata, including gender.
This network has 536 nodes and 3600 edges.
Tags: Social, Offline, Unwei…

Are BabyLMs Deaf to Gricean Maxims? A Pragmatic Evaluation of Sample-efficient Language Models
Raha Askari, Sina Zarrie{\ss}, \"Ozge Alacam, Judith Sieker
https://arxiv.org/abs/2510.04764

Are BabyLMs Deaf to Gricean Maxims? A Pragmatic Evaluation of Sample-efficient Language Models
Implicit meanings are integral to human communication, making it essential for language models to be capable of identifying and interpreting them. Grice (1975) proposed a set of conversational maxims that guide cooperative dialogue, noting that speakers may deliberately violate these principles to express meanings beyond literal words, and that listeners, in turn, recognize such violations to draw pragmatic inferences. Building on Surian et al. (1996)'s study of children's sensitivity to viol…

faculty_hiring: Faculty hiring networks (Comp. Sci., Business, History)
Three networks of faculty hiring in Computer Science Departments, Business Schools, and History Departments. Each node is a PhD-granting institution in the respective field, and a directed edge (i,j) indicates that a person received their PhD from node i and was tenure-track faculty at node j during time of collection (2011-2013). All data collected from faculty public rosters at the sampled institutions.
Thi…