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

Trend · papers per month

88177265353 · Jun 202019922001200920172026
48 results for Pretrained Representations

Pretraining method enhances dialogue representation learning across various tasks.

problem Scarce labeled data for specific dialogue tasks.
method Multi-task unsupervised pretraining with natural training objectives.
result Significant improvement in downstream tasks without encoder discrimination.

Robust reinforcement learning agents generalize well to out-of-distribution settings using pretrained representations.

problem Achieving sample-efficient reinforcement learning agents that generalize to real-world settings.
method Trained 240 representations and 10,000 RL policies on a simulated robotic setup, evaluating different pretrained VAE-based representations' effects on OOD generalization.
result Many reinforcement learning agents are surprisingly robust to realistic distribution shifts, including sim-to-real cases.

URL benchmark evaluates uncertainty quantification in pretrained models.

problem Need for reliable uncertainty estimates in transferable pretrained models.
method Proposes URL benchmark to measure transferability of representations and uncertainty estimates.
result Transferable uncertainty quantification remains challenging but not contradictory to traditional goals.

Study shows how pretraining robustness transfers to downstream tasks.

problem Understanding how robustness is transferred from pretraining to downstream tasks.
method Theoretical analysis and practical validation of robustness constraints.
result Robustness of a linear predictor on downstream tasks can be constrained by the robustness of its underlying representation.

WeatherFormer learns robust weather features from small datasets.

problem Modeling complex weather dynamics from limited data.
method Pretrained transformer encoder on large satellite dataset, with spatiotemporal encoding.
result State-of-the-art performance in county-level soybean yield prediction and influenza forecasting.

The dissertation establishes a contexture theory to mathematically characterize representation learning.

problem The lack of a scientific understanding of representation learning in foundation models.
method Introduces the contexture theory as a unified framework for analyzing representation learning methods.
result Representation learning is optimal when the association between input and context is neither too strong nor too weak.

CERT improves language understanding by contrastively learning sentence-level semantics.

problem Lack of sentence-level semantics in existing pretraining tasks.
method Contrastive self-supervised learning at the sentence level using back-translation augmentations.
result CERT outperforms BERT on 7 out of 11 GLUE benchmark tasks, achieving the same performance as BERT on 2 tasks.

New research shows deep models learn sparse features, limiting transfer learning; ensembling improves performance.

problem Sparse feature learning in deep models limits transfer learning performance.
method Developed a theoretical framework and proposed an ensembling strategy to aggregate multiple models.
result Ensembling yields a 9% improvement in transfer accuracy without extra pretraining cost.

POLAR learns efficient data acquisition policies using pretrained belief representations.

problem Challenges in learning effective policies for adaptive data acquisition.
method POLAR decouples representation learning from policy learning by leveraging pretrained predictive foundation models as belief-state encoders.
result POLAR outperforms state-of-the-art methods across diverse tasks while requiring fewer training samples.

This paper proves the theoretical advantage of unsupervised pretraining for machine learning tasks.

problem Understanding why unsupervised pretraining helps in machine learning tasks.
method A generic framework using Maximum Likelihood Estimation (MLE) for unsupervised pretraining and Empirical Risk Minimization (ERM) for downstream tasks.
result Proves an excess risk of ildeO(CΦ/m+CΨ/n) ilde{\mathcal{O}}(\sqrt{\mathcal{C}_Φ/m} + \sqrt{\mathcal{C}_Ψ/n}) for downstream tasks under mild conditions.

PULSE learns representations from physiological time series.

problem Lack of effective pretraining objectives for physiological time series.
method Proposes a pretraining framework exploiting dynamical systems generative model.
result PULSE learns representations that distinguish semantic classes and improve transfer learning.

SEMASIA provides a large dataset of latent representations for model comparison.

problem Difficulty in comparing semantic structures across different neural network models.
method Collection of latent representations from 1700 pretrained models across various benchmarks.
result Consistent semantic organization across models and datasets.

A new method uses a frozen language model to improve sample efficiency in reinforcement learning.

problem Improving sample efficiency in reinforcement learning with partially observable environments.
method FROZEN Hopfield network and HELM (History Embedding Language Model) method.
result HELM achieves new state-of-the-art results on Minigrid and Procgen environments.

New bounds for contrastive learning handle domain shifts and generalization.

problem Domain shifts and generalization challenges in downstream tasks.
method Novel generalization bounds accounting for both domain shift and generalization.
result Performance of contrastively learned representations depends on statistical discrepancy between pretraining and downstream distributions.

Synthetic continued pretraining enhances model performance with synthetic data.

problem Data inefficiency in pretrained models when adapting to domain-specific documents.
method Synthetic data augmentation using EntiGraph to create a large synthetic corpus.
result Language models can answer questions and follow instructions without access to domain-specific documents.

Public pretraining improves private model training even in extreme distribution shift scenarios.

problem Improving private model training accuracy in settings with large distribution shift.
method Empirical evaluation and theoretical explanation of public representations improving private training accuracy.
result Public representations can improve private training accuracy by up to 67% over private training from scratch in settings with large distribution shift.

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.

CLIP learns joint image-text representations for zero-shot learning.

problem Understanding and improving zero-shot transfer performance in CLIP.
method Formal study of transferrable representation learning and analysis of zero-shot transfer performance.
result Proposes a new CLIP-type approach that outperforms existing methods.

This paper improves model generalization by integrating diverse pretrained models.

problem Leveraging diverse pretrained models for robust out-of-distribution generalization.
method Characterize and integrate diverse pretrained models based on diversity and correlation shifts.
result Demonstrates state-of-the-art out-of-distribution generalization performance.

This study compares transfer learning and self-supervised learning for better model performance.

problem Choosing between transfer learning and self-supervised learning for optimal model performance.
method Comprehensive comparative study of transfer learning and self-supervised learning under various data and task properties.
result Self-supervised learning outperforms transfer learning in certain applications, and vice versa.

Deep Convolutional features extracted from a comprehensive labeled dataset, contain substantial representations which could be effectively used in a new domain. Despite the fact that generic features achieved good results in many visual tasks, fine-tuning is required for pretrained deep CNN models to be more effective …

2018-05-02abs ↗pdf ↗

RAE improves image representation learning with simplified design choices.

problem Improving image representation learning using pretrained vision encoders.
method Generalized RAE formulation, complementary working mechanisms of RAE and REPA, and free CFG guidance.
result RAEv2 achieves state-of-the-art results with 10x faster convergence and less training time.

Transformers learn new tasks from few examples via optimal approximation.

problem Learning new tasks from limited examples using large language models.
method Developed approximation and generalization error bounds for transformers trained on nonparametric regression tasks.
result Transformers achieve minimax optimal estimation risk in context.

Flaky performance found in GNN SSL on RDBs, leading to worse linear evaluation.

problem Downstream task performances of GNN SSL on RDBs are poor.
method Proposed InfoNode to maximize mutual information between initial and final node representations.
result InfoNode improves GNN SSL performance on RDBs, supporting conjecture of conflict between SSL and GNN message passing.

Deep neural networks trained on a wide range of datasets demonstrate impressive transferability. Deep features appear general in that they are applicable to many datasets and tasks. Such property is in prevalent use in real-world applications. A neural network pretrained on large datasets, such as ImageNet, can signifi…

2019-09-26abs ↗pdf ↗

Transformer model pretrains on synthetic graphs for AD detection.

problem Limited labeled data and class imbalance in AD diagnosis.
method Diffusion-generated synthetic graphs, Graph Transformers, transfer learning.
result Framework outperforms baselines in AD diagnosis metrics.

Paper analyzes self-supervised learning using causal methods and proposes a new objective.

problem Lack of theoretical understanding of self-supervised learning success.
method Uses a causal framework to enforce invariance constraints on proxy classifiers.
result ReLIC objective improves generalization guarantees and outperforms existing methods.

Tabular in-context learners perform well on biomolecular tasks, but performance depends on the representation used.

problem Predicting biomolecular properties from limited labeled data.
method Evaluating tabular in-context learners on protein fitness regression and small-molecule classification tasks.
result Tabular in-context learners are competitive for protein fitness regression but not for small-molecule classification.

Task-agnostic data augmentation shows little benefit for pretrained transformers.

problem Evaluating the effectiveness of task-agnostic data augmentation on pretrained transformers.
method Conducted a systematic examination of two data augmentation techniques (Easy Data Augmentation and Back-Translation) across 5 tasks, 6 datasets, and 3 pretrained transformer models.
result Data augmentation techniques previously effective for non-pretrained models fail to consistently improve performance for pretrained transformers, even with limited training data.

Researchers propose a new SSL risk decomposition method to evaluate and improve self-supervised learning models.

problem Self-supervised learning evaluation is limited to a single metric, providing little insight into model performance and improvement.
method Proposes an SSL risk decomposition that considers four error components: approximation, representation usability, probe generalization, and encoder generalization.
result Analysis of 169 SSL vision models reveals the main sources of error and provides insights for improving SSL models in specific settings.

Paper analyzes why deeper layers of ViTs perform worse on out-of-distribution tasks.

problem Performance degradation of intermediate layers in ViTs under distribution shift.
method Extensive linear probing experiments across various benchmarks and fine-grained analysis of transformer modules.
result Probing feedforward network activations yields best performance under significant distribution shift.

Pretraining models improves text classification accuracy, but diminishing returns are observed with large datasets.

problem Improving text classification accuracy with pretrained models.
method Examined the benefits of pretrained models on text classification tasks with varying amounts of training data.
result As the number of training examples grows into the millions, the accuracy gap between pretrained BERT-based models and vanilla LSTM narrows to within 1%.

Paper studies how few pretraining tasks are needed for a linear model to solve new tasks.

problem How many pretraining tasks are needed for a linear model to solve new tasks?
method Pretrained a linear attention model for linear regression with a Gaussian prior.
result Effective pretraining requires a small number of independent tasks, and the model closely matches Bayes optimal.

Method constructs finance LLMs without instruction data using pretraining and model merging.

problem Developing domain-specific LLMs for finance is resource-intensive.
method Continual pretraining on financial data + model merging of instruction-tuned and domain-specific pretrained vectors.
result Successfully constructs instruction-tuned LLMs for finance without additional instruction data.

Mask-reconstruction pretraining helps in downstream tasks by capturing more semantic features.

problem How mask-reconstruction pretraining helps in downstream tasks and why it surpasses supervised learning.
method Theoretical analysis and experimental validation of mask-reconstruction pretraining (MRP) on auto-encoders.
result MRP provably captures more semantic features than supervised learning, leading to better performance in downstream tasks.

Accelerates pulsar light curve inference with learned representations and optimization.

problem Computational expense of Markov chain Monte Carlo methods for posterior inference.
method Combining U-Net latent representations with local simulator-guided optimization.
result 120x reduction in inference time (24 hours to 12 minutes) with accuracy preserved.

Improves retrieval accuracy for hierarchical documents, especially for distant matches.

problem Limited expressive power of dual encoder models in hierarchical retrieval.
method Proves feasibility of DEs for HR, introduces pretrain-finetune recipe to improve long-distance retrieval.
result Pretrain-finetune boosts recall on long-distance pairs from 19% to 76%.

Adversarially trained generative models (GANs) have recently achieved compelling image synthesis results. But despite early successes in using GANs for unsupervised representation learning, they have since been superseded by approaches based on self-supervision. In this work we show that progress in image generation qu…

2019-07-04abs ↗pdf ↗