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

Trend · papers per month

56111167222 · Jun 202019922001200920182026
48 results for socialization strategies

Social learning can make financial markets inefficient, but individual learning can fix this.

problem Inefficiencies in financial markets due to social learning.
method Study of the Minority Game model with social and individual learning mechanisms.
result Individual learning can rescue a population from the inefficiencies caused by social learning.

Study online and offline social interactions using game theory.

problem Effects of online social networking on offline interactions and collective well-being.
method Evolutionary game theory approach to model socialization strategies.
result Self-protective behaviors can lead to non-socially optimal outcomes.

A deep learning strategy improves recommendation accuracy by leveraging trust and distrust relationships.

problem Data scarcity and cold-start problem in recommender systems.
method Social deep pairwise learning with a ranking loss function and social negative sampling.
result The proposed model achieves an 11.49% improvement over state-of-the-art methods.

Optimized trading strategies from social media sentiment data.

problem Creating profitable trading strategies from financial sentiment analysis.
method Evolutionary optimization applied to sentiment data.
result Numerical results show optimal trading strategies for DJIA stocks.

In this paper we focus on the beneficial role of random strategies in social sciences by means of simple mathematical and computational models. We briefly review recent results obtained by two of us in previous contributions for the case of the Peter principle and the efficiency of a Parliament. Then, we develop a new …

2012-09-26abs ↗pdf ↗

StratLearner learns strategies to prevent misinformation in social networks.

problem Learning strategies to protect against misinformation in social networks without knowing the diffusion model.
method Structured prediction framework using random features and large margin method.
result Our method produces near-optimal protectors without diffusion model information and outperforms other methods.

Crowdsourcing and active learning reduce manual annotation in social media event classification.

problem Manual annotation is time-consuming and resource-intensive in social media event classification.
method Crowdsourcing pipeline combined with active learning strategies.
result Active learning strategies help reduce the number of tweets needed for classification.

Proposes a multi-modal attention network for better stock price prediction.

problem Predicting future stock movements using historical records and social media.
method Extracts semantic information from social media, estimates credibility, and integrates with numeric features.
result Significantly improved prediction accuracy and trading profits compared to previous methods.

NAS model improves social recommendation accuracy using neural attention.

problem Capturing and weighing friends' preferences in social recommendation systems.
method Proposes a Neural Attention mechanism (NAS) for Social collaborative filtering.
result NAS model outperforms state-of-the-art methods in publicly available datasets.

Study optimizes CT and microinsurance for efficient social protection in low-income countries.

problem Efficient targeting of cash transfers to reduce social protection costs in low-income countries.
method Modelled household capital dynamics using piecewise-deterministic Markov process, derived HJB equation for optimal injection, used dynamic programming.
result Optimal level of capital injection above poverty threshold for cost-effective social protection.

New research shows strategic classification harms individuals and society.

problem Strategic behavior in decision-making leads to unfair outcomes.
method Introducing a social burden metric, the study quantifies the negative externalities of strategic classification.
result Any increase in institutional utility leads to a corresponding increase in social burden.

Aims to optimize influence spread in social networks using bandit algorithms.

problem Maximizing influence spread in unknown social networks.
method Combines Thompson Sampling and Epsilon Greedy algorithms with automatic ensemble learning.
result Demonstrates effectiveness of automatic ensemble learning for combinatorial bandit problems.

Robot learns from multiple teachers to efficiently achieve various motor skill outcomes.

problem Efficiently learning motor skills from multiple teachers and strategies.
method Hierarchical active decisions based on empirical evaluation of learning progress.
result Significantly more efficient learning and coherent strategy selection.

Model financial markets with social media influences using hierarchical networks.

problem Understanding social media's impact on financial markets.
method Agent-based model with hierarchical influence network.
result Model accurately simulates real-world financial market behaviors.

A new method uses CML to speed up social signal annotation.

problem Manual annotation of social signals in large multi-modal corpora is time-consuming and exhausting.
method CML techniques to predict local parts first, followed by a session-independent classification model.
result The method has the potential to significantly reduce human labelling efforts.

Study tackles hate speech against journalists on social media.

problem Hate speech against journalists on social media remains prevalent despite efforts.
method Defined journalist-specific hate speech, annotated tweets, trained deep learning models, and proposed an ensemble model.
result Proposed ensemble model outperforms individual models in detecting journalist-targeted hate speech.

This paper evaluates methods for predicting credit risk in social lending, especially for imbalanced data.

problem Predicting credit risk in imbalanced social lending environments.
method Empirical comparison of various classifier-resampling techniques, focusing on random forest and random under-sampling.
result Combining random forest and random under-sampling may be an effective strategy for predicting credit risk in social lending.

New study finds targeting based on treatment effects outperforms risk-based targeting in social interventions.

problem Lack of accurate treatment effect estimates for machine learning-based targeting in social domains.
method Empirical assessment of targeting strategies using data from 5 real-world RCTs in various domains.
result Treatment effect-based targeting outperforms risk-based targeting, even with biased estimates.

The paper explores fair machine learning policies for balancing competing objectives in noisy data.

problem Balancing competing objectives in noisy data.
method Analyzes a class of policies that trace an empirical Pareto frontier based on learned scores.
result Characterizes optimal strategies and bounds Pareto errors due to score inaccuracies.

The study proposes that people prioritize status maximization over simple profit maximization in social interactions.

problem The gap between competitive and altruistic human tendencies in social interactions.
method Agent-based model of repeated dictator games in a social network, considering living costs and infractions.
result Individual strategies in the game vary from selfish to selfless, influenced by model parameters.

Paper tackles online task allocation in multi-attribute social sensing.

problem Optimized task allocation in dynamic, multi-attribute social sensing.
method Quality-Cost-Aware Online Task Allocation (QCO-TA) scheme using online reinforcement learning.
result Significantly outperforms state-of-the-art baselines in sensing accuracy and cost.

Indirect competition emerged from the complex organization of human societies, and knowledge of the existing network topology may aid in developing effective strategies for success. Here, we propose an agent-based model of competition with systems co-existing in a `small-world' social network. We show that within the r…

2008-07-19abs ↗pdf ↗

Algorithm ensures fair information spread in social networks with community structure.

problem Disparities in information coverage between communities in social networks.
method Fits a model to the social network, uses community structure, and determines optimal seed allocations for fair coverage.
result Empirical accuracy demonstrated on simulated and real networks.

RLINK uses deep reinforcement learning to improve user identity linkage across social networks.

problem Recognizing the same user across different social networks.
method Converts user identity linkage into a sequence decision problem and uses deep reinforcement learning to optimize the linkage strategy.
result Achieves better performance than state-of-the-art methods in experiments on various datasets.

PreBit predicts Bitcoin price movements using social media and financial data.

problem Predicting extreme price movements of Bitcoin due to its volatility and speculative trading.
method Hybrid model combining FinBERT embeddings of Twitter content with candlestick data and technical indicators.
result The hybrid model can predict significant market movements with a profitable trading strategy.

Optimizes lockdown strategies to balance economic activities and virus spread.

problem Balancing economic activities and virus spread during lockdowns.
method Modeling the pandemic as SEIR, applying Granovetter threshold model for social distancing, and using NSGA-II optimization.
result Optimal lockdown policies for ten weeks to minimize infections and economic impact.

This study shows how social insects and machine learning methods share a common mathematical framework.

problem Understanding how decentralized systems achieve optimal decision-making.
method Developed a rigorous mathematical framework to show isomorphism between ant colonies and ensemble machine learning.
result Demonstrated that ant colony decision-making and random forest learning implement identical variance reduction strategies through decorrelation of identical units.

We optimize discounts to maximize influence spread in social networks.

problem Maximizing influence spread in social networks with fractional discounts.
method Developed an efficient (1-1/e)-approximation algorithm for NP-hard problem.
result Achieved an approximation of 1-1/e for influence maximization.

Model detects insurance fraud using social network analysis.

problem Fraudulent insurance claims by exaggeration or intentional damage.
method Network construction linking claims and parties, BiRank algorithm for fraud score computation, feature extraction from network and claims, supervised model building.
result Network features improve fraud detection performance.