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

591418 · Oct 201919922001200920172026
48 results for cross-dataset generalizability

Study improves machine learning models for GI tract disease detection using comprehensive evaluations and cross-dataset testing.

problem Incomplete or incorrect evaluation of machine learning models for GI tract diseases.
method Comprehensive evaluations of five machine learning models using Global Features and Deep Neural Networks, introducing performance hexagons and cross-dataset testing.
result Demonstrates the need for more sophisticated performance metrics and evaluation methods to build generalizable models.

MusPy is a toolkit for symbolic music generation, providing tools for dataset management and analysis.

problem Facilitating the creation and analysis of symbolic music datasets.
method Development of an open-source Python library (MusPy) with features for dataset management, data I/O, preprocessing, and model evaluation. Demonstrated through statistical analysis and cross-dataset generalizability experiments.
result MusPy's dataset analysis reveals varying degrees of cross-genre representation across different music datasets.

Unsupervised method detects earthquakes from raw waveforms, generalizing across datasets.

problem Lack of labeled data for earthquake detection.
method Uses deep autoencoders with cross-covariance triggering at bottleneck.
result Performance comparable to supervised methods, with strong cross-dataset generalization.

Method embeds numeric tabular datasets into a shared vector space for similarity and retrieval.

problem Lack of meaningful representation for numeric tabular datasets in large language models.
method Structured exploratory data analysis descriptors, sentence transformer embedding, CCA for cross-dataset alignment.
result Total P@1 score of 0.9 across 15 datasets, robust nearest-neighbor retrieval and cluster structure.

New method measures generalizability of deep neural networks based on decision boundary complexity.

problem Lack of generalization methods for deep neural networks.
method Created Decision Boundary Complexity (DBC) score to measure DNN complexity.
result Simpler decision boundaries lead to better generalizability, supporting Occam's Razor.

Proposes a method to evaluate generalizability in causal inference models.

problem Lack of formal procedures to statistically evaluate generalizability in causal inference.
method Frugal parameterization to simulate from causal benchmarks, using mean and distributional regression methods.
result Ensures more realistic evaluations of causal inference models, avoiding over-reliance on conventional metrics.

A hybrid ML method improves ship response predictions across different sea conditions.

problem Improving accuracy and generalizability of ML methods for ship response predictions.
method A hybrid machine learning method that corrects forces in a low-fidelity equation of motion.
result The hybrid method offers improved prediction accuracy and generalizability compared to benchmarks.

Bayesian meta-learning improves health prediction models across similar diseases.

problem Inter- and intra-task variability in healthcare predictions due to disease heterogeneity and patient differences.
method Bayesian meta-learning approach that models task similarity to mitigate negative transfer and improve generalizability.
result Significant generalizability improvements in stroke prediction tasks using electronic health record data.

Sep-SpectralNet improves SE for broader applicability and scalability.

problem Three main drawbacks of current SE implementations: generalizability, scalability, and eigenvectors separation.
method Sep-SpectralNet extends SpectralNet with an eigenvector separation post-processing step.
result Sep-SpectralNet achieves consistent SE approximation and generalization, enhancing scalability and applicability.

The study examines machine learning classification algorithms and their generalizability using Framingham Heart Study data.

problem Addressing biases and generalizability issues in machine learning classification algorithms.
method Comparison of eight machine learning classification algorithms on Framingham Heart Study data.
result Double discriminant scoring of type I is the most generalizable algorithm.

The paper analyzes GNNs with one hidden layer, proving their generalizability and convergence rate.

problem Theoretical guarantee on generalizability of GNNs with one hidden layer.
method Tensor initialization and accelerated gradient descent.
result The proposed learning algorithm converges to the ground-truth GNN model for regression and to a model close to the ground-truth for binary classification.

Recent advances in deep learning theory have evoked the study of generalizability across different local minima of deep neural networks (DNNs). While current work focused on either discovering properties of good local minima or developing regularization techniques to induce good local minima, no approach exists that ca…

2019-11-19abs ↗pdf ↗

Deep neural networks generalize well on unseen data though the number of parameters often far exceeds the number of training examples. Recently proposed complexity measures have provided insights to understanding the generalizability in neural networks from perspectives of PAC-Bayes, robustness, overparametrization, co…

2020-01-14abs ↗pdf ↗

CoPhy-PGNN tackles competing PG losses in neural networks for solving eigenvalue problems.

problem Solving eigenvalue problems with competing physics-guided loss functions.
method Learning generalizable solutions using a novel approach to handle competing PG losses.
result Demonstrates the effectiveness of the approach in quantum mechanics and electromagnetic propagation.

Study shows different trajectory prediction models generalize better under OoD conditions.

problem Comparing trajectory prediction models' robustness across different datasets.
method Training models on Argoverse 2 and testing on Waymo Open Motion, and vice versa, with various augmentation strategies.
result Smallest model with highest inductive bias performs best in OoD generalization.

Researchers use GANs to infer physics-based inverse problems, quantifying uncertainty and promoting generalizability.

problem Quantifying uncertainty in physics-based inverse problems.
method Trained conditional Wasserstein GANs with U-Net architecture and conditional instance normalization.
result The approach effectively samples from the posterior and promotes generalizability with out-of-distribution samples.

The paper shows how neural networks with less decision boundary variability generalize better.

problem Improving neural network generalizability by reducing decision boundary variability.
method Introduces new measures (algorithm DB variability and (ε,η)(ε, η)-data DB variability) to quantify decision boundary variability and proves theoretical bounds on generalizability.
result Neural networks with lower decision boundary variability have better generalizability, as shown by extensive experiments and theoretical bounds.

This work develops agents to learn generalizable policies for dynamic network environments.

problem Real-world network topologies change due to attackers, defenders, or system failures, leading to failures in adaptive ACD systems.
method Developing agents to learn generalizable policies across dynamic network environments.
result Agents can learn robust policies for dynamic network topologies and diverse attackers.

This paper addresses external validity bias in causal inference.

problem Estimating causal effects in a target population.
method Synthesis of approaches for generalizability and transportability, including tests for heterogeneity of treatment effects and differences between study and target populations.
result Framework for addressing external validity bias in causal inference.

Estimates causal effect of managed care plans on NYC Medicaid spending.

problem Generalizing causal estimates to a target population not well-represented by randomized studies.
method Conditional cross-design synthesis estimators combining randomized and observational data.
result Estimates causal effect of managed care plans on health care spending.

Paper proposes a framework to detect distribution shifts using embedding space geometry.

problem Detecting distribution shifts in candidate datasets to improve model generalizability.
method Non-parametric framework using embedding space geometry for two tests: robustness boundary and in-distribution/out-of-distribution classification.
result Both tests successfully detect distribution shifts in various scenarios for both synthetic and real-world datasets.

CausalCOMRL improves RL task representations by integrating causal relationships, enhancing generalizability.

problem Spurious correlations in context-based offline meta-reinforcement learning.
method CausalCOMRL integrates causal representation learning to uncover and incorporate causal relationships among task components.
result CausalCOMRL achieves better performance on meta-reinforcement learning benchmarks.

The paper analyzes the generalizability of linear autoencoders and multivariate linear regression.

problem Limited theoretical understanding of linear autoencoders' performance.
method Proposes a PAC-Bayes bound for multivariate linear regression and shows LAEs as constrained models.
result The proposed PAC-Bayes bound is tight and correlates with practical metrics.

Proposes tests to control confounding bias in predictive models.

problem Lack of non-parametric tests for confounding bias in predictive modeling.
method Partial and full confounder tests for probing null hypotheses of unconfounded and fully confounded models.
result Reveals previously unreported or hard-to-correct confounders in machine learning models.

A new framework improves tensor completion accuracy by considering numerical priors.

problem Tensor completion accuracy loss due to ignoring numerical priors.
method Generalized CP Decomposition Tensor Completion (GCDTC) framework incorporating numerical priors.
result GCDTC framework outperforms state-of-the-arts in non-negative tensor completion.

Flooding is a destructive and dangerous hazard and climate change appears to be increasing the frequency of catastrophic flooding events around the world. Physics-based flood models are costly to calibrate and are rarely generalizable across different river basins, as model outputs are sensitive to site-specific parame…

2019-10-15abs ↗pdf ↗

The paper tackles stock prediction models by improving their generalizability to out-of-sample domains using causal representation learning.

problem Low signal-to-noise ratio and nonstationary nature of financial markets lead to poor performance of stock prediction models.
method The paper investigates Domain Generalization techniques, focusing on causal representation learning to improve model generalizability. It introduces a novel error bound and a causal discovery technique to mitigate spurious correlations.
result The proposed approach enhances the generalizability of stock prediction models, as demonstrated by numerical results.

Meta-learning approaches have been proposed to tackle the few-shot learning problem.Typically, a meta-learner is trained on a variety of tasks in the hopes of being generalizable to new tasks. However, the generalizability on new tasks of a meta-learner could be fragile when it is over-trained on existing tasks during …

2018-05-20abs ↗pdf ↗

Paper proposes a new framework for individualized treatment rules that generalize better across different distributions.

problem Existing individualized treatment rules may not generalize well when training and testing distributions differ.
method Distributionally robust individualized treatment rules (DR-ITR) framework that maximizes worst-case value function across close distributions.
result Calibrated DR-ITR outperforms standard ITR in generalizability.

The paper develops methods to identify stable associations across multiple studies.

problem Identifying stable associations across multiple studies with possible distributional shifts.
method Modeling heterogeneous multi-source data with multiple high-dimensional regressions and devising a novel sampling method for valid confidence intervals of maximin effects.
result Significant maximin effects indicate stable associations that can be generalized to target populations.

New method improves image denoising with fewer parameters and less data.

problem Image denoising requires large datasets and supervised settings, limiting practical applications.
method Self-supervised framework using Tucker low-rank tensor approximation.
result Improves model generalizability and reduces data acquisition costs.

This paper explores how enforcing equivariance constraints limits neural network expressivity and proposes compensatory model size increases.

problem The impact of enforcing equivariance constraints on the expressive power of neural networks.
method Examined 2-layer ReLU networks, analyzed boundary hyperplanes and channel vectors, and constructed upper bounds on model size required for compensation.
result Enforcing equivariance constraints reduces the expressive power of neural networks, but this can be compensated by increasing model size.