arXiv:2601.02640v1 Announce Type: cross Abstract: We propose the first approach for multiple multivariate density-density regression (MDDR), making it possible to consider the regression of a multivariate density-valued response on multiple multivariate density-valued predictors. The core idea is to define a fitted distribution using a sliced Wasserstein barycenter (SWB) of push-forwards of the predictors and to quantify deviations from the observed response using the sliced Wasserstein (SW) distance. Regression functions, which map predictors’ supports to the response support, and […]

Ver mais

arXiv:2601.17031v1 Announce Type: new Abstract: The performance of medical image segmentation is increasingly defined by the efficiency of data utilization rather than merely the volume of raw data. Accurate segmentation, particularly for complex pathologies like meningiomas, demands that models fully exploit the latent information within limited high-quality annotations. To maximize the value of existing datasets, we propose a novel dual-augmentation framework that synergistically integrates spatial manifold expansion and semantic object injection. Specifically, we leverage Implicit Neural Representations (INR) […]

Ver mais

Dear Engineer, Software should not evolve in the blink of an eye; it should be a careful, methodical beast that steadily improves and makes incremental progress, with fast shifts only when necessary to benefit the user. I say this not to justify bureaucratic procedure, nor to suggest that implementation should take longer than necessary, and certainly not to argue against adopting genuine advancements, but to argue for the importance of timelessness both in the solution and the problem […]

Ver mais

arXiv:2403.10889v2 Announce Type: replace-cross Abstract: List learning is a variant of supervised classification where the learner outputs multiple plausible labels for each instance rather than just one. We investigate classical principles related to generalization within the context of list learning. Our primary goal is to determine whether classical principles in the PAC setting retain their applicability in the domain of list PAC learning. We focus on uniform convergence (which is the basis of Empirical Risk Minimization) and on […]

Ver mais

arXiv:2601.05473v1 Announce Type: new Abstract: This paper presents a conceptual and methodological framework for large language model (LLM) based student simulation in educational settings. The authors identify a core failure mode, termed the “competence paradox” in which broadly capable LLMs are asked to emulate partially knowledgeable learners, leading to unrealistic error patterns and learning dynamics. To address this, the paper reframes student simulation as a constrained generation problem governed by an explicit Epistemic State Specification (ESS), which defines […]

Ver mais

We consider time discretization for score-based diffusion models to generate samples from a learned reverse-time dynamic on a finite grid. Uniform and hand-crafted grids can be suboptimal given a budget on the number of time steps. We introduce Adaptive Reparameterized Time (ART) that controls the clock speed of a reparameterized time variable, leading to a time change and uneven timesteps along the sampling trajectory while preserving the terminal time. The objective is to minimize the aggregate error arising […]

Ver mais

How Structured Schemas Are Quietly Revolutionizing Human-AI Communication Protocols The discourse around prompt engineering has largely centered on linguistic creativity — the art of crafting persuasive natural language that coaxes better responses from large language models. But beneath this surface-level conversation, a more fundamental shift is occurring: the migration from probabilistic, free-form prompting to deterministic, schema-driven interaction patterns. JSON prompting represents not merely a formatting preference, but a paradigm shift in how we architect human-AI interfaces. The Interface Design Problem […]

Ver mais

arXiv:2505.15638v2 Announce Type: replace-cross Abstract: We revisit the classical problem of Bayesian ensembles and address the challenge of learning optimal combinations of Bayesian models in an online, continual learning setting. To this end, we reinterpret existing approaches such as Bayesian model averaging (BMA) and Bayesian stacking through a novel empirical Bayes lens, shedding new light on the limitations and pathologies of BMA. Further motivated by insights from online optimization, we propose Online Bayesian Stacking (OBS), a method that […]

Ver mais

arXiv:2602.06899v1 Announce Type: cross Abstract: Recovering a unique causal graph from observational data is an ill-posed problem because multiple generating mechanisms can lead to the same observational distribution. This problem becomes solvable only by exploiting specific structural or distributional assumptions. While recent work has separately utilized time-series dynamics or multi-environment heterogeneity to constrain this problem, we integrate both as complementary sources of heterogeneity. This integration yields unified necessary identifiability conditions and enables a rigorous analysis of the statistical […]

Ver mais

arXiv:2602.20217v1 Announce Type: new Abstract: Self-speculative decoding (SSD) accelerates LLM inference by skipping layers to create an efficient draft model, yet existing methods often rely on static heuristics that ignore the dynamic computational overhead of attention in long-context scenarios. We propose KnapSpec, a training-free framework that reformulates draft model selection as a knapsack problem to maximize tokens-per-time throughput. By decoupling Attention and MLP layers and modeling their hardware-specific latencies as functions of context length, KnapSpec adaptively identifies optimal […]

Ver mais