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

Trend · papers per month

1345 · Oct 202419922001200920172026
48 results for Dataset-specific

Enhances Transformer models for multivariate time series with dataset-specific channel masks.

problem Capturing channel dependency in multivariate time series models.
method Introduces partial channel dependence and channel masks to refine channel dependency in Transformers.
result Improves model performance across diverse tasks and datasets.

In the absence of sufficient data variation (e.g., scanner and protocol variability) in annotated data, deep neural networks (DNNs) tend to overfit during training. As a result, their performance is significantly lower on data from unseen sources compared to the performance on data from the same source as the training …

2019-08-16abs ↗pdf ↗

This study benchmarks tabular data generation models, optimizing hyperparameters and feature encodings.

problem Generating realistic tabular data is challenging due to heterogeneity, non-smooth distributions, and complex dependencies.
method Comprehensive evaluation of five model families on 16 datasets, considering hyperparameters, feature encodings, and architectures.
result Large-scale dataset-specific tuning significantly improves model performance, especially for diffusion-based models.

A new multi-view clustering method that is fast, scalable, and easy to use.

problem High computational complexity, one-stage fusion, and dataset-specific hyperparameter tuning in multi-view clustering.
method Random view groups, hybrid early-late fusion, diversified base clusterings, and unified bipartite graph.
result Almost linear time and space complexity, no dataset-specific tuning required.

We consider high-dimensional distribution estimation through autoregressive networks. By combining the concepts of sparsity, mixtures and parameter sharing we obtain a simple model which is fast to train and which achieves state-of-the-art or better results on several standard benchmark datasets. Specifically, we use a…

2015-11-15abs ↗pdf ↗

Simultaneous clustering and optimization (SCO) has recently drawn much attention due to its wide range of practical applications. Many methods have been previously proposed to solve this problem and obtain the optimal model. However, when a dataset evolves over time, those existing methods have to update the model freq…

2019-08-04abs ↗pdf ↗

Deep learning methods such as multitask neural networks have recently been applied to ligand-based virtual screening and other drug discovery applications. Using a set of industrial ADMET datasets, we compare neural networks to standard baseline models and analyze multitask learning effects with both random cross-valid…

2016-06-28abs ↗pdf ↗

This paper introduces a novel optimization method for differential neural architecture search, based on the theory of prediction with expert advice. Its optimization criterion is well fitted for an architecture-selection, i.e., it minimizes the regret incurred by a sub-optimal selection of operations. Unlike previous s…

2019-06-19abs ↗pdf ↗

We present a novel approach to leverage large unlabeled datasets by pre-training state-of-the-art deep neural networks on randomly-labeled datasets. Specifically, we train the neural networks to memorize arbitrary labels for all the samples in a dataset and use these pre-trained networks as a starting point for regular…

2018-11-05abs ↗pdf ↗

New benchmarks for RNA 3D structure-function modeling.

problem Lack of standardized benchmarks for RNA deep learning.
method Developed seven benchmark datasets, provided tools for data handling, and offered a user-friendly environment for model comparison.
result Demonstrated utility with baseline results using a relational graph neural network.

FairVIC improves fairness in neural networks without sacrificing accuracy.

problem Mitigating bias in automated decision-making systems, particularly in deep learning models.
method Integrates variance, invariance, and covariance terms into the loss function during training to abstract fairness concepts.
result Significant improvements in fairness across all tested metrics without compromising accuracy.

We present a new technique called contrastive principal component analysis (cPCA) that is designed to discover low-dimensional structure that is unique to a dataset, or enriched in one dataset relative to other data. The technique is a generalization of standard PCA, for the setting where multiple datasets are availabl…

2017-09-20abs ↗pdf ↗

TabPFN doesn't outperform GLM and XGBoost for motor insurance pricing.

problem Improving insurance pricing models using Tabular Foundation Models (TFMs).
method Pre-training on synthetic datasets and in-context learning for inference.
result TabPFN does not consistently outperform established baselines, has longer inference times, and is sensitive to training set size.

CACTI improves tabular data imputation by leveraging missingness patterns and contextual information.

problem Tabular data imputation with improved accuracy and robustness.
method Masked autoencoding approach with median truncated copy masking and contextual information.
result Average R2R^2 gain of 7.8% over the next best method across various datasets and missingness conditions.

PICLE uses probabilistic models to efficiently evaluate and compose modules for continual learning.

problem Challenging search space of module compositions in continual learning.
method Probabilistic framework to cheaply compute module compositions' fitness.
result First modular CL algorithm to achieve perceptual, few-shot, and latent transfer.

Unlike previous works, this open data collection consists of X-ray cone-beam (CB) computed tomography (CT) datasets specifically designed for machine learning applications and high cone-angle artefact reduction. Forty-two walnuts were scanned with a laboratory X-ray set-up to provide not only data from a single object …

2019-05-12abs ↗pdf ↗

Traditional approaches to Bayes net structure learning typically assume little regularity in graph structure other than sparseness. However, in many cases, we expect more systematicity: variables in real-world systems often group into classes that predict the kinds of probabilistic dependencies they participate in. Her…

2012-06-27abs ↗pdf ↗

Study introduces a benchmark suite for evaluating neural MI estimators on real-world unstructured datasets.

problem Lack of comprehensive evaluation methods for neural MI estimators on real-world unstructured datasets.
method Developed a benchmark suite using same-class sampling and a binary symmetric channel trick.
result Showed accurate manipulation of true MI values of real-world datasets.

GTDL methods fail to accurately model feature interactions in tabular data.

problem Accurate modeling of feature interactions in tabular data.
method Graph-based tabular deep learning methods using attention mechanisms and message-passing schemes.
result Current GTDL methods fail to recover meaningful feature interactions due to poor edge recovery.

Decentralized learning achieves centralized performance via Gibbs measures.

problem Achieving centralized performance in decentralized machine learning.
method ERM-RER learning framework with Gibbs measures and relative-entropy regularization.
result Achieving centralized performance with Gibbs measures and specific scaling of regularization factors.

Paper introduces RiskEmbed, a finetuned model for financial risk management.

problem Improving retrieval accuracy in financial question-answering systems.
method Curated dataset and finetuned BERT model for financial domain.
result RiskEmbed significantly outperforms general-purpose and financial embedding models.

We study binary classification algorithms for which the prediction on any point is not too sensitive to individual examples in the dataset. Specifically, we consider the notions of uniform stability (Bousquet and Elisseeff, 2001) and prediction privacy (Dwork and Feldman, 2018). Previous work on these notions shows how…

2019-11-24abs ↗pdf ↗

Study evaluates three class imbalance techniques across diverse datasets.

problem Class imbalance in binary classification tasks.
method Synthetic Minority Over-sampling Technique (SMOTE), Class Weights tuning, Decision Threshold Calibration.
result Decision Threshold Calibration is the most consistently effective technique.

Paper uses financial news for stock trend forecasting using deep multiple instance learning.

problem Forecasting stock trends from financial news articles.
method Developed a flexible and adaptive multi-instance learning model for bags of instances (financial news articles) on trading days.
result Outstanding trend prediction accuracy compared to state-of-the-art approaches.

Infinite BART model selects number of trees and allows different functions for clusters.

problem Regression and classification analysis with automatic tree selection and cluster-specific functions.
method Incorporates an Indian Buffet process prior to select a subset of decision trees for each observation.
result Infinite BART model outperforms classic BART on simulated and real datasets.

URT layer improves few-shot image classification across diverse domains.

problem Few-shot image classification in multi-domain settings.
method Meta-learns to dynamically re-weight and compose domain-specific representations.
result Sets new state-of-the-art on Meta-Dataset.

Suitability filter detects model performance degradation in real-world deployment.

problem Ensuring model reliability in safety-critical domains without access to ground truth labels.
method Uses suitability signals to evaluate classifier performance on unlabeled user data.
result The suitability filter reliably detects performance deviations due to covariate shift.

PClean automates Bayesian data cleaning for specific datasets.

problem Bayesian inference for diverse and complex data cleaning.
method Domain-specific probabilistic programming language with custom models and inference.
result PClean programs outperform general-purpose PPLs in accuracy and runtime.

We introduce a new metric to evaluate corruption robustness of ML classifiers.

problem Evaluating corruption robustness of machine learning classifiers.
method We propose a test data augmentation method using minimal class separation distance to derive a robustness distance ε and a metric MSCR.
result The MSCR metric allows interpretable comparison of classifier robustness on different datasets.