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.

169,042 papers · 148 categories

Trend · papers per month

0.4%0.8%1.2%1.6% · Nov 202419922001200920172026
48 results for cross-domain sentiment

HAGAN uses hierarchical attention to improve cross-domain sentiment classification.

problem Cross-domain sentiment classification with domain discrepancy.
method Hierarchical attention in GANs to produce domain-indistinguishable document representations.
result HAGAN outperforms existing methods on Amazon review dataset.

A new method improves cross-domain sentiment analysis by learning weighted domain-invariant representations.

problem Label distribution changes across domains harm domain adaptation in DIRL.
method Proposes WDIRL, a modification to DIRL that learns weighted domain-invariant representations.
result Empirical studies show the effectiveness of WDIRL in cross-domain sentiment analysis.

Automated sentiment classification (SC) on short text fragments has received increasing attention in recent years. Performing SC on unseen domains with few or no labeled samples can significantly affect the classification performance due to different expression of sentiment in source and target domain. In this study, w…

2018-08-28abs ↗pdf ↗

Cross-domain collaborative filtering (CF) aims to alleviate data sparsity in single-domain CF by leveraging knowledge transferred from related domains. Many traditional methods focus on enriching compared neighborhood relations in CF directly to address the sparsity problem. In this paper, we propose superhighway const…

2018-08-28abs ↗pdf ↗

A new model CDT improves cross-domain recommendation by learning translation vectors.

problem Improving cross-domain recommendation by transferring user preferences across different platforms.
method Translation-based learning approach with embedding space and factorization machines.
result The proposed CDT model outperforms other cross-domain strategies in six publicly available tasks.

Sparse coding has shown its power as an effective data representation method. However, up to now, all the sparse coding approaches are limited within the single domain learning problem. In this paper, we extend the sparse coding to cross domain learning problem, which tries to learn from a source domain to a target dom…

2013-11-27abs ↗pdf ↗

Proposes ADC for cross-domain recommendation balancing user preferences.

problem Users' preferences change across different domains (e.g., social media, e-commerce).
method Designs a neural architecture and cross-domain loss function to adaptively balance user preferences.
result ADC model effectively balances the impact of domains with different complexities.

JSCN improves cross-domain recommendation by learning domain-invariant user representations.

problem Cross-domain recommendation data sparsity and domain-incompatibility issues.
method JSCN uses multi-layer spectral convolutions on different graphs to learn domain-invariant user representations and domain adaptive user mappings.
result Significant improvement in cross-domain recommendation performance (9.2% recall, 36.4% MAP improvements).

This paper compares deep transfer learning with classical ML in low-shot text classification.

problem Low-shot text classification with limited labeled data.
method Comparison of BERT and top classical ML approaches on a sentiment classification task.
result BERT outperforms classical ML by 9.7% on average with 100 labeled examples per class.

ADGAN improves risk tolerance prediction by aligning cross-domain data.

problem Lack of professional knowledge and domain-specific models in risk tolerance studies.
method Asymmetric cross-Domain Generative Adversarial Network (ADGAN) for domain scale inequality.
result ADGAN better handles class imbalance and unqualified data than state-of-the-art methods.

NeuCDCF combines matrix factorization and deep learning for cross-domain recommendation.

problem Data sparsity and cold-start problems in recommendation systems.
method Wide and deep framework combining matrix factorization and deep neural networks.
result NeuCDCF outperforms state-of-the-art models on real-world datasets.

GWIL uses Gromov-Wasserstein distance to align expert and imitation agent states.

problem Cross-domain imitation learning challenges due to different system dimensions and stationary distributions.
method Gromov-Wasserstein Imitation Learning (GWIL) using Gromov-Wasserstein distance.
result GWIL effectively aligns expert and imitation agent states in various continuous control domains.

DMGE learns cross-domain user behavior embeddings using multi-graphs and GNNs.

problem Data sparsity in learning large-scale item embedding from individual domain data.
method Construct multi-graphs from users' behaviors across domains, use multi-graph neural networks to learn cross-domain representation.
result DMGE outperforms state-of-the-art embedding methods in various tasks.

Study shows cross-domain X-ray prediction performance discrepancies and label shifts.

problem Quantifying generalization limits across different X-ray datasets.
method Large-scale study on multiple X-ray datasets, focusing on performance and label shifts.
result Interesting discrepancies found between model performance and agreement, and concept similarity across tasks.

CosML combines domain-specific meta-learners for cross-domain few-shot classification.

problem Generalizing to unseen domains while meta-learning on multiple seen domains.
method CosML trains domain-specific meta-learners and combines their meta-parameters in the parameter space.
result CosML outperforms state-of-the-art methods and achieves strong cross-domain generalization.

Ensuring the security of transactions is currently one of the major challenges that banking systems deal with. The usage of face for biometric authentication of users is attracting large investments from banks worldwide due to its convenience and acceptability by people, especially in cross-domain scenarios, in which f…

2018-06-20abs ↗pdf ↗

New approach improves cross-domain recommendation for sparse target domains.

problem Cross-domain recommendation challenges with sparse target domains.
method Guided neural collaborative filtering with domain-invariant components across dense and sparse domains.
result Effective and scalable approach demonstrated on public and Visa datasets.

A new model for imputing missing values in time series data across domains.

problem Imputing missing values in time series data across domains with domain shifts and high missing rates.
method A diffusion-based imputation model that integrates shared spectral components and domain-specific temporal structures, with cross-domain consistency alignment.
result Our model effectively handles missing values and domain shifts, outperforming existing methods.

The cross-domain recommendation technique is an effective way of alleviating the data sparse issue in recommender systems by leveraging the knowledge from relevant domains. Transfer learning is a class of algorithms underlying these techniques. In this paper, we propose a novel transfer learning approach for cross-doma…

2018-04-18abs ↗pdf ↗

Study finds investor sentiment has a significant positive relationship with stock returns in Moroccan and Tunisian markets.

problem Investor sentiment and stock returns relationship in Moroccan and Tunisian markets.
method Used indirect measures of investor sentiment (SENT and ARMS) and Granger causality tests.
result Sentiment has a significant positive relationship with stock returns, but not the other way around.

The recent empirical success of unsupervised cross-domain mapping algorithms, between two domains that share common characteristics, is not well-supported by theoretical justifications. This lacuna is especially troubling, given the clear ambiguity in such mappings. We work with adversarial training methods based on IP…

2018-07-23abs ↗pdf ↗

News sentiment in U.S. economic newspapers has become more persistent over 45 years.

problem Understanding the temporal dynamics of U.S. economic news sentiment over time.
method Daily economic news sentiment index from 1980-2025, analyzed using sentiment indexes.
result News sentiment states have become more persistent, with longer residence times in optimistic or pessimistic regimes.

Study uses Granger causality to show investor sentiment influences stock prices.

problem Understanding the relationship between investor sentiment and stock market movements.
method Applied Granger causality to analyze the relationship between close price index and sentiment score.
result Sentiment analysis shows a positive correlation with stock price movements.

MWGAN tackles multi-marginal matching problem with Wasserstein GAN.

problem Learning mappings to match a source domain to multiple target domains with cross-domain correlations.
method Develops a novel Multi-marginal Wasserstein GAN (MWGAN) with inner- and inter-domain constraints to minimize Wasserstein distance.
result Theoretical and empirical evaluations show MWGAN's effectiveness on balanced and imbalanced translation tasks.

Can textual data be compressed intelligently without losing accuracy in evaluating sentiment? In this study, we propose a novel evolutionary compression algorithm, PARSEC (PARts-of-Speech for sEntiment Compression), which makes use of Parts-of-Speech tags to compress text in a way that sacrifices minimal classification…

2017-09-20abs ↗pdf ↗

Proposes IFCDA framework to improve cross-domain adaptation.

problem Negative transfer and difficulty in handling category-irrelevant losses in DA.
method Importance filtered mechanism to generate filtered soft labels, combined with graph-based label propagation.
result Significantly improves performance in both Closed-Set and Open-Set DA scenarios.

Investor sentiment improves model accuracy but complexity doesn't always boost predictive power.

problem Determining the optimal complexity of investor sentiment measures in asset pricing models.
method Comprehensive review of 71 papers from 2000-2021, analyzing various sentiment measures and models.
result Higher complexity of sentiment measures does not necessarily improve predictive power.

Model quantifies market sentiment using news data.

problem Quantifying high-frequency market sentiment for economists.
method Support vector machine classifiers for sentiment analysis; stochastic volatility model for joint evolution.
result News sentiment raises the threshold of volatility reversion.

The ability to identify sentiment in text, referred to as sentiment analysis, is one which is natural to adult humans. This task is, however, not one which a computer can perform by default. Identifying sentiments in an automated, algorithmic manner will be a useful capability for business and research in their search …

2018-04-05abs ↗pdf ↗

Enhanced portfolio selection using sentiment data and LSTM.

problem Improving portfolio selection through sentiment analysis and price prediction.
method Semantic Attention Model for sentiment prediction, LSTM for price prediction, mean-variance strategy for portfolio optimization.
result Sentiment-aware portfolio strategies outperform non-sentiment aware models on average.

Sentiment analysis of DAX40 stocks improves performance by 5.38% annually.

problem Creating a more responsive stock market index using sentiment analysis.
method Extract sentiment from news articles, adjust index weights based on sentiment, compare performance to existing indices.
result Sentiment index outperforms DAX40 by 7.51% annually, adjusted for costs.

Study uses sentiment analysis to predict implied volatility surface, improving prediction accuracy.

problem Improving prediction accuracy of implied volatility surface.
method Constructed daily high-frequency sentiment data, used VAR method, deep learning (BERT, LSTM), FFT, EMD for sentiment decomposition.
result High-frequency sentiment correlates with ATM options' implied volatility, low-frequency with DOTM options.

Clustering consists of grouping together samples giving their similar properties. The problem of modeling simultaneously groups of samples and features is known as Co-Clustering. This paper introduces ROCCO - a Robust Continuous Co-Clustering algorithm. ROCCO is a scalable, hyperparameter-free, easy and ready to use al…

2018-02-14abs ↗pdf ↗

Proposes a new method for manifold alignment using geometry-regularized twin autoencoders.

problem Traditional MA methods lack out-of-sample extension and real-world applicability.
method Guided representation learning with geometry-regularized twin autoencoders.
result Improves cross-domain generalization and robustness while maintaining alignment fidelity.