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

1122 · Oct 201919922001200920172026
36 results for Data-hungry

3D convolutional neural networks are difficult to train because they are parameter-expensive and data-hungry. To solve these problems we propose a simple technique for learning 3D convolutional kernels efficiently requiring less training data. We achieve this by factorizing the 3D kernel along the temporal dimension, r…

2019-12-09abs ↗pdf ↗

Automatic summarisation is a popular approach to reduce a document to its main arguments. Recent research in the area has focused on neural approaches to summarisation, which can be very data-hungry. However, few large datasets exist and none for the traditionally popular domain of scientific publications, which opens …

2017-06-13abs ↗pdf ↗

In recent years, supervised machine learning models have demonstrated tremendous success in a variety of application domains. Despite the promising results, these successful models are data hungry and their performance relies heavily on the size of training data. However, in many healthcare applications it is difficult…

2018-12-03abs ↗pdf ↗

Deep neural networks are data hungry models and thus face difficulties when attempting to train on small text datasets. Transfer learning is a potential solution but their effectiveness in the text domain is not as explored as in areas such as image analysis. In this paper, we study the problem of transfer learning for…

2018-10-15abs ↗pdf ↗

SQS uses quantum kernels to improve credit scoring with fewer data points.

problem Credit scoring models struggle with scarce and skewed data.
method Systemic Quantum Score (SQS) leverages quantum kernels for better pattern extraction.
result SQS shows improved performance and pattern extraction with fewer data points.

The need for labour intensive pixel-wise annotation is a major limitation of many fully supervised learning methods for segmenting bioimages that can contain numerous object instances with thin separations. In this paper, we introduce a deep convolutional neural network for microscopy image segmentation. Annotation iss…

2019-06-20abs ↗pdf ↗

While deep learning has achieved remarkable results on various applications, it is usually data hungry and struggles to learn over non-stationary data stream. To solve these two limits, the deep learning model should not only be able to learn from a few of data, but also incrementally learn new concepts from data strea…

2019-08-27abs ↗pdf ↗

Generative models in molecular design tend to be richly parameterized, data-hungry neural models, as they must create complex structured objects as outputs. Estimating such models from data may be challenging due to the lack of sufficient training data. In this paper, we propose a surprisingly effective self-training a…

2020-02-11abs ↗pdf ↗

Proposes a synthesis algorithm using Conformal Prediction for improved Deep Learning performance.

problem Assessing the quality of synthesised data for high-stake domains.
method Conformal Prediction framework for generating data from high-confidence feature space regions.
result Training sets extended with confident synthesised data improved Deep Learning performance by up to 61 percentage points F1-score.

MDNs offer a data-efficient alternative to diffusion and flow models for multimodal scientific learning.

problem Capturing multimodal conditional uncertainty in scientific inverse problems.
method Mixture Density Networks (MDNs) as explicit parametric density estimators.
result MDNs achieve superior generalization, interpretability, and sample efficiency in scientific tasks.

In recent years, deep learning models have shown great potential in source code modeling and analysis. Generally, deep learning-based approaches are problem-specific and data-hungry. A challenging issue of these approaches is that they require training from starch for a different related problem. In this work, we propo…

2019-10-12abs ↗pdf ↗

PropEn uses matching to create a larger dataset for efficient design optimization.

problem Limited data and complex landscapes in scientific applications.
method PropEn uses a matching approach to implicitly guide design without a discriminator.
result PropEn efficiently approximates the gradient of property improvement within the data distribution.

Study proposes a new method for deep portfolio optimization using residual factors.

problem Non-stationary financial market makes traditional machine learning methods ineffective.
method Predict distribution of residual factors using a novel neural network architecture with financial inductive biases.
result Demonstrated improved performance on U.S. and Japanese stock market data.

BSA-TNP improves NP scalability and accuracy for spatiotemporal data.

problem Scalability and accuracy trade-off in Neural Processes.
method Introduces KRBlocks, group-invariant attention biases, and BSA for scalable spatiotemporal inference.
result BSA-TNP matches or exceeds accuracy of best models while training faster.

Generative AI models improve clinical trial data by generating survival outcomes.

problem Generating valid survival outcomes for clinical trials with synthetic data.
method A variational autoencoder (VAE) that jointly generates mixed-type covariates and survival outcomes.
result The method outperforms GAN baselines on fidelity, utility, and privacy metrics.

Develops a Bayesian framework for symbolic regression of scientific expressions.

problem Lack of principled uncertainty quantification and interpretability in existing symbolic regression methods.
method Hierarchical Bayesian framework with tree-structured symbolic expressions and Markov chain Monte Carlo inference.
result Robust performance on various datasets, including single-atom catalysis.

New analysis shows transfer learning can significantly reduce sample size for complex models.

problem Reducing sample size needed for complex models like large language models.
method Optimal transport viewpoint applied to analyze transfer learning efficiency.
result Transfer learning can achieve better sample efficiency for complex models.

Propagates adversarial robustness in federated learning.

problem Heterogeneous federated users with non-iid data and limited resources.
method Adversarial robustness propagation through batch-normalization.
result Federated models achieve remarkable robustness even with limited adversarial training.

SWIFT learns intrinsic rewards from LLM hidden states for efficient best-of-N sampling.

problem Efficiency and scalability of reward models for LLMs.
method SWIFT (Simple Weighted Intrinsic Feedback Technique) learns a reward function directly from LLM hidden states.
result SWIFT outperforms existing baselines by 12.7% on MATH dataset while using less than 0.005% of their parameters.

This paper explores emerging methods for estimating variable importance in machine learning.

problem Estimating the importance of variables in machine learning models.
method Least Absolute Shrinkage and Selection Operator (LASSO), Support Vector Machine (SVM), Predictive Error Function (PERF), Random Forest (RF), Extreme Gradient Boosting (XGBOOST).
result PERF and RF showed the best performance in highly correlated data, while PERF and XGBOOST performed poorly on small data sizes.

This paper proposes an unsupervised learning method to solve heat equations on chips.

problem Critical need for solving heat transfer equations on chips for 5G and AI.
method Hybrid framework of Auto Encoder and Image Gradient for unsupervised learning.
result Framework can solve heat transfer problems with a single training process and predict unseen cases.

Adaptive batch size schedules improve language model training efficiency and generalization.

problem Dilemma of choosing batch sizes in large-scale model training.
method General-purpose adaptive batch size schedules compatible with data and model parallelism.
result Adaptive batch size schedules outperform constant batch sizes and heuristic warmup schedules.

ECG-DelNet uses neural networks to accurately delineate ECGs, even with low-quality data.

problem Lack of model explainability and small databases limit deep learning applicability in ECG detection.
method Adapted U-Net architecture for 1D data, used PhysioNet's QT database, applied data augmentation and regularization techniques.
result Best configuration achieved high precision and recall for P, QRS, and T waves.