Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,878 papers · 148 categories

Trend · papers per month

18.8%37.5%56.3%75.0% · Jul 199319922001200920172026
48 results for Lab test embeddings

Embeddings of lab test codes improve mortality prediction and preserve ordinality.

problem Improving mortality prediction using lab test embeddings.
method Training embeddings for LOINC codes and their concatenations with abnormality symbols, evaluating performance on mortality prediction tasks.
result Embeddings of lab test codes improve mortality prediction and preserve ordinality.

Bayesian nonparametric LABS model adapts to function smoothness in Besov spaces.

problem Estimating functions with unknown smoothness in Besov spaces.
method Lévy Adaptive B-spline (LABS) regression model with automatic smoothness adaptation.
result LABS posterior contracts around true function in Besov classes at nearly minimax-optimal rates.

Proposes using entity embedding vectors to improve Gaussian Process models for knowledge transfer across cell lines.

problem Lack of reuse of experimental data for predicting novel processes.
method Hybrid Gaussian Process models with entity embedding vectors to represent product identity.
result Improved performance in predicting novel processes compared to traditional methods.

Machine learning constructs problem-based medical records from electronic health records.

problem Difficulty in finding relevant medical information for clinical questions.
method Knowledge base completion using machine learning on electronic health records.
result Automatic construction of problem-based groupings of medications, procedures, and lab tests.

This study measures price risk aversion using indirect utility functions in a lab experiment.

problem Measuring risk aversion with uncertain prices in experimental economics.
method Using indirect utility functions and a multiple price list method in a lab experiment.
result Price risk aversion is statistically greater than payoff risk aversion.

SLM Lab is a framework for reproducible RL research with modular algorithms.

problem Reproducibility in deep reinforcement learning.
method Modular software framework for RL algorithms, synchronous/asynchronous execution, hyperparameter search, result analysis.
result Comprehensive benchmark and novel RL algorithms (e.g., discrete-AC variant, hybrid training method).

Icebreaker tackles active information acquisition with low data, improving model performance.

problem Deploying machine learning models with minimal training data, where each feature acquisition is costly.
method Proposes a full Bayesian Deep Latent Gaussian Model (BELGAM) with novel inference methods.
result Significantly outperforms previous models in small data settings, improving test time performance.

Traditionally, psychophysical experiments are conducted by repeated measurements on a few well-trained participants under well-controlled conditions, often resulting in, if done properly, high quality data. In recent years, however, crowdsourcing platforms are becoming increasingly popular means of data collection, mea…

2019-05-17abs ↗pdf ↗

The paper revisits classical competition theory to explain speculative asset price dynamics.

problem Understanding the dynamics of speculative asset prices and their volatility.
method Specialized classical model of competition with reservation prices, incorporating speculation.
result The model explains excess, fat-tailed, and clustered volatility in speculative asset prices.

Research proposes a risk-free machine learning model for COVID screening from routine blood tests.

problem Rapid antigen tests have low sensitivity and are not suitable for widespread screening.
method Stacked Ensemble Machine Learning model using routine blood tests.
result 100% accuracy, precision, recall and F1-score in identifying COVID patients.

Financial markets provide a natural quantitative lab for understanding some of the most advanced human behaviours. Among them is the use of mathematical tools known as financial instruments. Besides money, the two most fundamental financial instruments are bonds and equities. More than 30 years ago Mehra and Prescott f…

2015-07-26abs ↗pdf ↗

The Madry Lab recently hosted a competition designed to test the robustness of their adversarially trained MNIST model. Attacks were constrained to perturb each pixel of the input image by a scaled maximal LL_\infty distortion εε = 0.3. This discourages the use of attacks which are not optimized on the LL_\infty dis…

2017-10-30abs ↗pdf ↗

The reproducing kernel Hilbert space (RKHS) embedding of distributions offers a general and flexible framework for testing problems in arbitrary domains and has attracted considerable amount of attention in recent years. To gain insights into their operating characteristics, we study here the statistical performance of…

2017-09-24abs ↗pdf ↗

Study shows gMPNNs struggle with OOD link prediction in larger test graphs.

problem Inductive out-of-distribution link prediction in larger test graphs.
method Theoretical analysis and development of a gMPNN with structural pairwise embeddings.
result Structural node embeddings from gMPNNs converge to random guessing as test graphs grow.

A novel kernel-based test detects equality versus singularity of two probability measures.

problem Detecting equality versus singularity of two probability distributions.
method Combines kernel mean and kernel covariance embeddings to construct a likelihood ratio test statistic.
result The test statistic satisfies a '0/\infty' law, vanishing under the null and diverging under the alternative.

Kernel embeddings separate distinct probability distributions, simplifying testing.

problem Testing equality of non-atomic probability distributions.
method Kernel covariance embeddings and Gaussian measures in reproducing kernel Hilbert spaces.
result Testing for singularity between Gaussian measures is equivalent to testing for equality of non-atomic probability distributions.

A statistical test of independence may be constructed using the Hilbert-Schmidt Independence Criterion (HSIC) as a test statistic. The HSIC is defined as the distance between the embedding of the joint distribution, and the embedding of the product of the marginals, in a Reproducing Kernel Hilbert Space (RKHS). It has …

2015-01-25abs ↗pdf ↗

New tests for binary classification regression functions without distribution assumptions.

problem Testing regression functions in binary classification without distributional assumptions.
method Conditional kernel mean embeddings and resampling-based framework.
result Distribution-free hypothesis tests with exact type I error control.

Enhanced kernel ridgeless regression improves performance with LAB RBF kernels.

problem Lack of flexibility in kernel ridgeless regression.
method Locally-Adaptive-Bandwidths (LAB) RBF kernels and kernel learning techniques.
result Functions learned from LAB RBF kernels belong to an integral space of RKHSs, demonstrating robust generalization.

Metric learning methods for dimensionality reduction in combination with k-Nearest Neighbors (kNN) have been extensively deployed in many classification, data embedding, and information retrieval applications. However, most of these approaches involve pairwise training data comparisons, and thus have quadratic computat…

2017-02-21abs ↗pdf ↗

This study improves sentence embeddings from BERT models.

problem Capturing the underlying meaning of sentences using BERT models.
method Comprehensive review and testing of various sentence embedding extraction and refinement methods.
result Representation-shaping techniques significantly improve sentence embeddings from BERT-based and simple baseline models.

Algorithm recovers causal graphs in presence of latent confounders and selection bias.

problem Recovering causal graphs in the presence of latent confounders and selection bias.
method Iterative causal discovery (ICD) algorithm that relies on causal Markov and faithfulness assumptions.
result Sound and complete algorithm that recovers the equivalence class of the underlying causal graph.