arXiv:2602.07072v1 Announce Type: new Abstract: Long-horizon code generation requires sustained context and adaptive expertise across domains. Current multi-agent systems use static workflows that cannot adapt when runtime analysis reveals unanticipated complexity. We propose AgentSpawn, an architecture enabling dynamic agent collaboration through: (1) automatic memory transfer during spawning, (2) adaptive spawning policies triggered by runtime complexity metrics, and (3) coherence protocols for concurrent modifications. AgentSpawn addresses five critical gaps in existing research around memory continuity, skill inheritance, task resumption, […]

Ver mais

I maintain cuTile Rust and just posted the paper “Fearless Concurrency on the GPU.” As more GPU code gets AI-generated, the bottleneck moves from writing it to trusting it. cuTile Rust lets you write or generate GPU kernels whose memory safety and data-race freedom are verified by the compiler, through Rust’s ownership and borrow checking. You get those guarantees by construction. It’s a tile-based programming model that lowers to CUDA Tile IR, carrying Rust’s ownership model across the […]

Ver mais

arXiv:2601.08929v1 Announce Type: new Abstract: We study when the variable-indexed matrix of pairwise (f)-mutual informations (M^{(f)}_{ij}=I_f(X_i;X_j)) is positive semidefinite (PSD). Let (f:(0,infty)tomathbb{R}) be convex with (f(1)=0), finite in a neighborhood of (1), and with (f(0)<infty) so that diagonal terms are finite. We give a sharp emph{local} characterization around independence: there exists (delta=delta(f)>0) such that for every (n) and every finite-alphabet family ((X_1,ldots,X_n)) whose pairwise joint-to-product ratios lie in ((1-delta,1+delta)), the matrix (M^{(f)}) is PSD if and only if […]

Ver mais

arXiv:2512.17340v2 Announce Type: replace-cross Abstract: Fair regression methods have the potential to mitigate societal bias concerns in health care, but there has been little work on penalized fair regression when multiple groups experience such bias. We propose a general regression framework that addresses this gap with unfairness penalties for multiple groups. Our approach is demonstrated for binary outcomes with true positive rate disparity penalties. It can be efficiently implemented through reduction to a cost-sensitive classification problem. We additionally […]

Ver mais

arXiv:2604.22756v1 Announce Type: new Abstract: Conjoint analysis is a cornerstone of market research for estimating consumer preferences; however, traditional methods face persistent challenges regarding time, cost, and respondent fatigue. To address these limitations, this study proposes a framework that utilizes large language model (LLM)-based “customer digital twins (CDT)” as virtual respondents. We identified active users within the Reddit community and aggregated their comprehensive review histories to construct individualized vector databases. By integrating retrieval-augmented generation (RAG) with prompt engineering, […]

Ver mais

arXiv:2603.16983v1 Announce Type: new Abstract: Machine learning models for geotechnical hazard prediction can achieve high accuracy while learning physically inconsistent relationships from sparse or biased training data. Current remedies (post-hoc explainability, such as SHAP and LIME, and training-time constraints) either diagnose individual predictions approximately or restrict model capacity without providing exhaustive guarantees. This paper encodes trained tree ensembles as logical formulas in a Satisfiability Modulo Theories (SMT) solver and checks physical specifications across the entire input domain, not […]

Ver mais

arXiv:2210.09709v3 Announce Type: replace Abstract: Importance weighting is a standard tool for correcting distribution shift, but its statistical behavior under target shift — where the label distribution changes between training and testing while the conditional distribution of inputs given the label remains stable — remains under-explored. We analyze importance-weighted kernel ridge regression under target shift and show that, because the weights depend only on the output variable, reweighting corrects the train-test mismatch without altering the input-space complexity that […]

Ver mais

This paper presents a lightweight K-Means anomaly detection model and a distributed model-sharing workflow designed for resource-constrained microcontrollers (MCUs). Using real power measurements from a mini-fridge appliance, the system performs on-device feature extraction, clustering, and threshold estimation to identify abnormal appliance behavior. To avoid retraining models on every device, we introduce the Distributed Internet of Learning (DIoL), which enables a model trained on one MCU to be exported as a portable, text-based representation and reused directly on other […]

Ver mais