AINeutralarXiv – CS AI · 3d ago6/10
🧠Researchers introduce an active learning framework for inferring continuous probability distributions from sparse data snapshots, addressing a key challenge in fields like single-cell biology where data collection is destructive and expensive. The method uses Linearized Optimal Transport to map probability distributions into a space suitable for Gaussian Process modeling, enabling uncertainty-guided selection of optimal measurement times.
AINeutralarXiv – CS AI · May 285/10
🧠Researchers propose Supervised Distributional Reduction (SDR), a machine learning algorithm combining optimal transport theory with dependence maximization to create compact data representations that preserve both geometric structure and predictive information. The method extends the Fused Gromov-Wasserstein framework and offers applications in representation learning and adaptive kernel design for Gaussian Process modeling.
AINeutralarXiv – CS AI · May 116/10
🧠Researchers introduce DT-PBO, a tree-based surrogate model for Preferential Bayesian Optimization that prioritizes interpretability over traditional Gaussian Process approaches. The method achieves competitive performance on benchmark functions while providing transparent insights into decision-maker preferences, addressing critical needs in high-stakes domains like healthcare.
$MKR
AIBullisharXiv – CS AI · Mar 37/108
🧠Researchers propose SEED-SET, a new Bayesian experimental design framework for ethical testing of autonomous systems like drones in high-stakes environments. The system uses hierarchical Gaussian Processes to model both objective evaluations and subjective stakeholder judgments, generating up to 2x more optimal test candidates than baseline methods.
AINeutralarXiv – CS AI · Mar 54/10
🧠Researchers developed a Bayesian framework combining particle filters and Gaussian processes for robotic tactile object recognition and pose estimation. The system can identify known objects, detect novel objects, and transfer knowledge to learn new shapes through active touch exploration.
AINeutralarXiv – CS AI · Mar 34/104
🧠Researchers introduce COMBRL, a new reinforcement learning algorithm designed for continuous-time systems using nonlinear ordinary differential equations. The algorithm achieves sublinear regret and better sample efficiency compared to existing methods by combining probabilistic models with uncertainty-aware exploration.
AINeutralarXiv – CS AI · Feb 274/107
🧠Researchers established a new theoretical framework connecting Bayesian neural networks to Gaussian processes, developing improved convergence results and identifiability properties. They introduced a scalable computational method using Nyström approximation for training and prediction, demonstrating competitive performance on real-world datasets.
