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,695 papers · 148 categories

Trend · papers per month

223445668890 · Jun 202019922001200920172026
48 results for algorithmic foundations

GAMformer bridges tabular models and interpretability, offering a single-pass approach.

problem Lack of interpretability in tabular foundation models like TabPFN.
method In-context learning for GAM shape functions, training on synthetic data.
result GAMformer performs comparably to other leading GAMs across various classification benchmarks.

Distance metric learning is a branch of machine learning that aims to learn distances from the data, which enhances the performance of similarity-based algorithms. This tutorial provides a theoretical background and foundations on this topic and a comprehensive experimental analysis of the most-known algorithms. We sta…

2018-12-14abs ↗pdf ↗

This article gives the foundations of the colored Jones polynomial for singular knots. We extend Masbum and Vogel's algorithm to compute the colored Jones polynomial for any singular knot. We also introduce the tail of the colored Jones polynomial of singular knots and use its stability properties to prove a false thet…

2017-05-06abs ↗pdf ↗

Foundation models improve wage gap decomposition by capturing omitted career history factors.

problem Estimating wage disparities using incomplete career history data.
method Fine-tuning foundation models to mitigate omitted variable bias and estimate wage gaps.
result Foundation models can decompose gender wage gaps more accurately than traditional econometric methods.

Framework tackles class imbalance and noisy labels in active learning.

problem Class imbalance and noisy labels in real-world datasets.
method Uses foundation model priors to select informative samples for active learning.
result Substantial annotation savings (over 50%) with preserved performance and robustness.

Introduces foundation priors for using model-generated data in empirical research.

problem Using model-generated data as real observations in empirical research.
method Introduces foundation priors as an exponential-tilted, generalized Bayesian update of the user's primitive prior.
result Synthetic data reflects both model patterns and user's priors, enabling principled use in empirical work.

Revises Bayesian model averaging for foundation models.

problem Ensemble pre-trained and lightly-finetuned foundation models for improved classification performance.
method Introduces trainable linear classifiers and computationally cheaper model averaging scheme (OMA).
result Ensembled models can better predict on various datasets.

The study provides theoretical foundations for using smaller instances to predict algorithm performance on larger ones.

problem Scalability challenge in evaluating algorithms on large instances.
method Formalized size generalization, providing theoretical guarantees for predicting algorithm performance on large instances using smaller, representative instances.
result Characterized the subsample size sufficient to ensure performance on the subsample reflects performance on the full instance.

Time series foundation models are well-calibrated, improving over baseline models.

problem Calibration of time series foundation models for practical applications.
method Systematic evaluations of five time series foundation models and two baselines, assessing calibration, prediction heads, and long-term forecasting.
result Time series foundation models are consistently better calibrated than baseline models and do not show over- or under-confidence.

Combines foundation models with weak supervision to improve NLP and video tasks.

problem Leveraging weak supervision with foundation models without labeled data.
method Liger, a combination of foundation model embeddings and weak supervision techniques.
result Liger outperforms existing weak supervision methods by 14.1 points on benchmark NLP and video tasks.

New measure assesses time series pre-training data quality without labels.

problem Challenges in collecting diverse pre-training datasets for time series classification.
method Contrastive-learning-based foundation model and contrastive accuracy measure.
result Contrastive accuracy correlates with model performance on downstream tasks.

DAG-FM discovers causal relationships from heterogeneous data.

problem Challenges in causal discovery from heterogeneous causal mechanisms.
method DAG-FM uses two specialized Transformer-based sub-modules and a robust tabular interaction block to model complex row-column interactions.
result DAG-FM achieves state-of-the-art performance on synthetic and real-world datasets.

New method extracts biological concepts from cell microscopy images.

problem Extracting meaningful concepts from vision foundation models trained on cell microscopy images.
method Sparse dictionary learning (DL) combined with PCA whitening pre-processing.
result Successfully retrieved biologically meaningful concepts like cell types and genetic perturbations.

This thesis explores robust machine learning against adversarial examples.

problem How to create machine learning systems robust to adversarial examples.
method Theoretical exploration and development of new learning algorithms with robustness guarantees.
result Developed new learning algorithms with provable robustness guarantees.

A model learns causal graphs from summary statistics of synthetic data.

problem Causal discovery algorithms are brittle with large sets of variables and limited data.
method A supervised model trained on synthetic data predicts causal graphs from summary statistics.
result The model generalizes well beyond its training set and runs on large graphs.

New method reduces fine-tuning cost for reused models.

problem Repeating fine-tuning costs with outdated foundation models.
method Portable Reward Tuning (PRT) trains a reward model to maximize the same loss function as fine-tuning.
result PRT achieves comparable accuracy to inference-time tuning with less inference cost.

Foundation models outperform supervised methods in time series forecasting across various operational regimes.

problem Lack of domain-specific training and ongoing maintenance in supervised learning for time series forecasting.
method Evaluation of foundation models against standard supervised approaches across four operational regimes: periodic, physically constrained, stochastic, and demand forecasting.
result Foundation models are optimal for cold-start or long-tail scenarios and perform well in domains with transferable periodic structures.

Improved regret bound for linear ensemble sampling.

problem Closing the gap between theory and practice in linear ensemble sampling.
method General regret analysis framework for linear bandit algorithms, revealing a relationship with LinPHE.
result Achieves a frequentist regret bound of ildeO(d3/2T) ilde{O}(d^{3/2}\sqrt{T}) for linear ensemble sampling.

Paper proposes verifier engineering for improving foundation models.

problem Challenges in providing effective supervision signals for foundation models.
method Leverages automated verifiers to perform verification tasks and deliver feedback.
result Verifier engineering can enhance foundation models' capabilities.

Foundation models improve time series prediction reliability, especially with limited data.

problem Improving time series prediction reliability with limited data.
method Comparison of Time Series Foundation Models (TSFMs) with traditional methods in conformal prediction.
result TSFMs provide more reliable conformalized prediction intervals and more stable calibration with limited data.

Foundation models improve on econometric benchmarks for forecasting volatility, but vary widely across models.

problem Comparing pretrained time series foundation models to econometric benchmarks for volatility forecasting.
method Systematic comparison of nine zero-shot TSFMs against eight econometric specifications on 50 assets across 3 markets and 3 horizons.
result Tiny Time Mixers (TTM) is the only model that consistently beats the Log-HAR benchmark, but performance varies widely across models.

Tabular foundation models outperform other methods in conditional density estimation across various datasets.

problem Estimating the full conditional distribution of a response given tabular covariates, especially in settings with heteroscedasticity, multimodality, or asymmetric uncertainty.
method Benchmarked three tabular foundation model variants (TabPFN and TabICL) against six CDE baselines on 39 real-world datasets.
result Tabular foundation models achieve the best CDE loss, log-likelihood, and CRPS across all sample sizes, outperforming other methods.

Foundation AI model outperforms traditional VaR methods in forecasting.

problem Forecasting Value-at-Risk (VaR) for financial returns.
method Time-series foundation AI model, pre-trained on diverse datasets, fine-tuned for specific quantiles.
result Fine-tuned foundation model consistently outperforms traditional methods in actual-over-expected ratios.

Mantis improves time series classification using a transformer model trained on synthetic data.

problem Insufficient application of foundation models to time series classification.
method Pre-trained transformer model on synthetic data, enhanced test-time methodology.
result Mantis achieves state-of-the-art performance across diverse datasets.

Framework fine-tunes foundation models with semi-supervised learning for downstream tasks and latent spaces.

problem Training foundation models with limited labelled data.
method Mutual information decomposition for downstream and latent spaces, semi-supervised fine-tuning.
result Significant improvements in classification tasks under low-labelled conditions.

RTE enables extrapolation to new tasks by learning task transformations.

problem Learning systems struggle to generalize to unseen tasks.
method Relational Task Extrapolator (RTE) learns task transformations to enable extrapolation.
result RTE substantially outperforms existing approaches on extrapolation tasks.

Study evaluates interpretability of time series foundation models' latent spaces.

problem Improving interpretability of latent spaces in time series models for visual analytics.
method Evaluated MOMENT family of transformer-based models on five datasets, fine-tuning for performance.
result Fine-tuning improved latent space clarity but limited interpretability remained.

New framework explains leading digit patterns without probabilistic assumptions.

problem Explaining leading digit distributions without relying on probabilistic models.
method Shift-invariant functional equation and affine-plus-periodic formulas.
result Unified mathematical foundation for understanding digit distributions.

VMoER improves uncertainty quantification in MoE layers for scalable foundation models.

problem Uncertainty quantification in large-scale models like MoE layers.
method Structured Bayesian approach with amortized variational inference over routing logits and temperature parameter inference.
result Improves routing stability, reduces calibration error, and increases AUROC by 12%.

EAGLE-Net enhances foundation models by integrating patch-level features for better tissue understanding.

problem Foundation models lack mechanisms for global tissue structure and local context in computational pathology.
method EAGLE-Net combines multi-scale spatial encoding, attention-guided loss functions, and background suppression to aggregate patch-level features into slide-level predictions.
result EAGLE-Net improves classification accuracy and concordance indices across multiple cancer types, producing biologically coherent attention maps.

CDFM aims to unify causal discovery across diverse datasets.

problem Fragmented, test-driven causal discovery approaches struggle with modern data heterogeneity.
method CDFM is a unified, general-purpose framework using a variational decomposition of causal mechanisms.
result CDFM outperforms traditional algorithms across diverse datasets.

We present a computational toolkit for (local) Poisson-Nijenhuis calculus on manifolds. Our python module PoissonGeometry\textsf{PoissonGeometry} implements our algorithms, and accompanies this paper. We include two examples of how our methods can be used, one for gauge transformations of Poisson bivectors in dimension 3, and a sec…

2019-12-04abs ↗pdf ↗

GIFT-Eval benchmarks time series forecasting models across diverse datasets.

problem Lack of comprehensive benchmarks for evaluating time series foundation models.
method Developed GIFT-Eval, a benchmark with 23 datasets, 177 million data points, and 144,000 time series.
result Promotes evaluation of foundation models across various domains and frequencies.

Paper addresses DP in bandits, focusing on zCDP and providing private algorithms.

problem Privacy concerns in recommender systems using user-sensitive data.
method Formalizes and compares different DP adaptations to bandits, proposes private algorithms for various bandit settings.
result Private algorithms ensure negligible privacy costs compared to non-private regret.