Skip to content

Category

data science

2,788 papers

#artificial intelligence Open access Jun 2020

Limits of Transfer Learning

Several novel results related to transfer learning are proved, showing the need to carefully select which sets of information to transfer and the need for dependence between transferred information and target problems and how the degree of probabilistic change in an algorithm using transfer places an upper bound on the...

Jake Williams, Abel Tadesse, Tyler Sam et al. · 17 citations · ⚡1
#artificial intelligence Preprint Jul 2026

Pay Only for Disagreement: Certified No-Regression Verdicts for Model Updates with Matching Label-Complexity Bounds

This work formalizes update promotion as certified paired risk-difference auditing as well as building DISCERN, a sequential two-tier protocol that proves finite-sample validity and matching label-complexity bounds of order rho^2/eps^2 at the rate level.

Vishnu Balachandran · 2 citations
#artificial intelligence Preprint Sep 2026

Bad Genius: Counterfactual-Guided Harness Evolution Beyond Task-Specific Shortcuts

This work introduces Counterfactual Harness Search and Evolution (CHASE), which casts harness evolution as constraint generation over valid counterfactual benchmarks and formalizes an ideal shortcut-neutralized benchmark $B_0$ and establishes theoretical guarantees linking finite counterfactual archives to $B_0$ and ch...

Guo-Jun Zhu, Xu Huang, Peng Yin et al. · 0 citations
#machine learning Preprint Open access Sep 2026

Random Hazard Forests

Clinical data sources such as electronic health records and wearable sensors record patient status repeatedly over follow-up, often at irregular times and on different schedules for different measurements. These data create opportunities for continuously updated, individualized risk prediction. Existing approaches, how...

Hemant Ishwaran, Eileen M. Hsich, Udaya B. Kogalur et al. · 0 citations

Missing Data Imputation under Manifold Hypothesis

This work proposes a model-based imputation method that enables sampling from p via a sampling-importance-resampling (SIR) procedure, which can be further augmented with a joint diffusion model in the latent space, and achieves competitive performance compared to state-of-the-art procedures.

Z. Bi, Amuche Ibenegbu, S. Moka · 0 citations
#machine learning Preprint Open access Sep 2026

Universal Feature Selection with Noisy Observations and Weak Symmetry Conditions

This paper relaxes the restrictive symmetry conditions adopted in [4], [5] and extends their universal feature selection framework to accommodate noisy observations as well as attribute structures that may exhibit directional preferences. We introduce the notion of weak spherical symmetry, quantified by second-moment d...

Dier Tang (Department of Mathematics, The University of Hong Kong, Hong Kong et al. · 0 citations
#artificial intelligence Open access Mar 2026

Equivalence of approximation by networks of single- and multi-spike neurons

It is shown that for every approximation bound that is valid for a set of multi-spike neural networks, there is an equivalent set of single-spike neural networks with only linearly more (or less) neurons, in the maximum number of spikes, for which the bound holds.

Dominik Dold, Philipp C. Petersen · 2 citations
#machine learning Review Dec 2025

Nonnegative matrix factorizations and related compositional models: Equivalence, identifiability, and an application on the grain-size analysis of sediments

It is proved that the solution of LBA, EMA, LCA, PLSA is unique if and only if the solution of NMF is unique, which means existing uniqueness theorems for NMF directly apply to LBA, EMA, LCA, PLSA, and vice versa.

Qian-Qian Qi, P. V. D. van der Heijden, M. Prins · 3 citations

Neural Stochastic Differential Equations on Compact State-Spaces

A novel class of expressive SDEs whose solutions are provably confined to a prescribed compact polyhedral state space, matching the domains of EMA data is developed, paving the way for principled, trustworthy continuous-time models of suicide risk and other clinical time series.

Yue Liu, Malinda Lu, Matthew K. Nock et al. · 1 citation

BASIS: Batchwise Advantage Estimation from Single-Rollout Information Sharing for LLM Reasoning

BASIS, a critic-free post-training algorithm designed to address the tradeoff between computational efficiency and sample efficiency in value estimation and policy learning, achieves performance close to multi-rollout GRPO-type baselines and often outperforms single-rollout REINFORCE-type baselines.

Shi-Jin Gong, Erhan Xu, Kai Ye et al. · 2 citations
#machine learning Preprint Open access Sep 2026

Training Energy-Based Models with Non-MCMC Samplers and Efficient Temperature Estimation

Efficient sampling from Boltzmann distributions over discrete variables is a fundamental operation in a wide range of applications. While fast non-MCMC samplers have recently emerged as promising alternatives to conventional MCMC methods, their practical use for probabilistic learning remains hindered by the difficulty...

Kentaro Kubo, Hayato Goto · 0 citations
#machine learning Preprint Sep 2026

Conformal Policy Learning with Distribution-Free Safety Guarantees

Conformal policy learning (CPL) is proposed, a policy learning procedure with a new distribution-free safety guarantee that controls the probability of assigning treatment to an individual who would be harmed relative to control and achieves asymptotically optimal welfare subject to the safety constraint.

Ying Jin, Naoki Egami · 0 citations

From tech blogs

See all →

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.