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

Trend · papers per month

3897791,1681,557 · Jun 202019922001200920172026
48 results for social reinforcement learning

Efficiently models agent dependencies in large social networks.

problem Challenges in incorporating inter-agent dependencies in social reinforcement learning models.
method Clusters users based on payoff and contribution, combines cluster-level policies with personalized agent-level policies, and uses dynamic clustering.
result Our approach learns more accurate policy estimates and converges more quickly than existing methods.

Heterogeneous SVO leads to diverse policies in sequential social dilemmas.

problem Understanding how diverse social value orientations affect behavior in sequential social dilemmas.
method Extending prior reinforcement learning studies, we instantiated heterogeneous SVO in a sequential social dilemma setting and measured task-specific diversity metrics.
result Heterogeneous SVO leads to meaningfully diverse policies across various incentive structures.

The study examines how social biases are reinforced in machine learning models used for credit scoring.

problem Reinforcement of societal biases in machine learning algorithms for credit scoring.
method Analysis of machine learning models predicting gender or ethnicity based on loan applications data.
result Machine learning models can reflect and reinforce social biases present in the data.

Efficiently selects seed nodes to maximize content influence in unknown social networks.

problem Maximizing content spread in social networks with unknown network model.
method Formulated as an infinite-horizon discounted MDP, uses model-based reinforcement learning to select seed users adaptively.
result Established a regret bound of O~(T)\widetilde O(\sqrt{T}) for the algorithm.

Develops a personalized reinforcement learning algorithm for dyadic health interventions.

problem Personalizing health interventions for dyadic relationships in mobile health.
method Dyadic Reinforcement Learning (dyadic RL), a Bayesian and hierarchical online algorithm.
result Established a regret bound and demonstrated empirical performance through simulations and real data.

Study shows social reinforcement learning can lead to persistent but metastable polarization.

problem Understanding the persistence and dynamics of opinion polarization.
method Simulation and mathematical analysis of a reinforcement learning model of opinion dynamics.
result Polarization observed in the model is metastable and will eventually lead to consensus.

Controversies around race and machine learning have sparked debate among computer scientists over how to design machine learning systems that guarantee fairness. These debates rarely engage with how racial identity is embedded in our social experience, making for sociological and psychological complexity. This complexi…

2018-11-28abs ↗pdf ↗

RLHF performs well despite violating social choice theory axioms.

problem RLHF's empirical success contradicts social choice theory axioms.
method Showed RLHF satisfies pairwise majority and Condorcet consistency under mild assumptions, and introduced new alignment criteria.
result RLHF satisfies pairwise majority and Condorcet consistency under mild assumptions, explaining its practical success.

MIM-Reasoner learns seed users for maximizing influence in multiplex networks.

problem Maximizing influence in multiplex networks with multiple layers of social interactions.
method Combining reinforcement learning with probabilistic graphical models.
result Established a theoretical guarantee for MIM-Reasoner's performance.

Study tackles RLHF with diverse human feedback, showing limitations and proposing a meta-learning approach.

problem Traditional RLHF fails to balance diverse human preferences.
method Integrates meta-learning and multiple social welfare functions to optimize diverse preferences.
result Establishes sample complexity bounds for optimizing diverse social welfare functions.

DQ4FairIM uses RL to maximize influence while ensuring fairness across all groups.

problem Fairness in influence maximization in social networks.
method Fairness-aware deep RL method using Structure2Vec network embedding.
result DQ4FairIM achieves higher fairness than fairness-agnostic and fairness-aware baselines.

Decision support systems (e.g., for ecological conservation) and autonomous systems (e.g., adaptive controllers in smart cities) start to be deployed in real applications. Although their operations often impact many users or stakeholders, no fairness consideration is generally taken into account in their design, which …

2019-07-24abs ↗pdf ↗

User identity linkage is a task of recognizing the identities of the same user across different social networks (SN). Previous works tackle this problem via estimating the pairwise similarity between identities from different SN, predicting the label of identity pairs or selecting the most relevant identity pair based …

2019-10-31abs ↗pdf ↗

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.

A new method simulates large, diverse populations of learning agents evolving in games.

problem Limited scalability and efficiency of Multi-Agent Reinforcement Learning.
method Parallelizable implementation of Policy Gradient and Opponent-Learning Awareness for evolutionary simulations.
result Simulated large, diverse populations of learning agents evolve under various strategies.

Research tackles alliance formation in many-player zero-sum games, showing reinforcement learning fails but a contract mechanism can help.

problem Tackles the challenge of alliance formation in many-player zero-sum games.
method Demonstrates the social dilemma aspect of alliance formation, introduces a contract mechanism to augment reinforcement learning.
result Naïve reinforcement learning fails to form alliances, but a contract mechanism can help.

We study the inverse optimal control problem in social sciences: we aim at learning a user's true cost function from the observed temporal behavior. In contrast to traditional phenomenological works that aim to learn a generative model to fit the behavioral data, we propose a novel variational principle and treat user …

2018-05-22abs ↗pdf ↗

Graph Neural Networks (GNNs) have been popularly used for analyzing non-Euclidean data such as social network data and biological data. Despite their success, the design of graph neural networks requires a lot of manual work and domain knowledge. In this paper, we propose a Graph Neural Architecture Search method (Grap…

2019-04-22abs ↗pdf ↗

Study shows trust and trustworthiness emerge through reinforcement learning.

problem Trust and trustworthiness are universal but not predicted by traditional economic models.
method Used Q-learning algorithm to simulate trust and trustworthiness dynamics in a trust game.
result High levels of trust and trustworthiness emerge when individuals consider both past and future experiences.

A new model characterizes undocumented and asymptomatic infections to quantify COVID-19 uncertainties.

problem Quantifying uncertainties in COVID-19 infections and contagion.
method SUDR model: characterizes undocumented and documented infections, captures probabilistic density, and incorporates Bayesian inference.
result Demonstrates deeper understanding of COVID-19 uncertainties compared to classic models.

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.

Optimizes stock portfolios with profit, risk, and sustainability.

problem Balancing profit, risk, and sustainability in stock portfolio management.
method Developed a novel utility function combining Sharpe ratio and ESG scores; used genetic algorithm for optimization.
result System outperforms traditional reinforcement learning methods and improves on risk and sustainability metrics.

Research tackles investor confusion in ESG rankings, offering tailored strategies.

problem Widespread confusion among investors regarding ESG rankings.
method Developed ESG ensemble strategies, integrated ESG scores into RL model, proposed Double-Mean-Variance model, introduced ESG-adjusted CAPMs.
result Optimized portfolios that balance financial returns and ESG-focused outcomes.

Social goods, such as healthcare, smart city, and information networks, often produce ordered event data in continuous time. The generative processes of these event data can be very complex, requiring flexible models to capture their dynamics. Temporal point processes offer an elegant framework for modeling event data …

2018-11-12abs ↗pdf ↗

MACC learns communication protocols by adapting counterfactual reasoning.

problem Credit assignment and non-stationarity in communication environments.
method Adapts counterfactual reasoning to overcome credit assignment and uses action policy and Q-function of other agents to handle non-stationarity.
result MACC outperforms state-of-the-art baselines in four scenarios.

AI-driven tax policies improve economic equality and productivity.

problem Lack of appropriate economic data and limited opportunity to experiment.
method Two-level deep reinforcement learning approach to learn dynamic tax policies from observational data.
result AI-driven tax policies improve the trade-off between equality and productivity by 16%.

This paper tackles online strategic decision making with asymmetry and knowledge transportability.

problem Strategic decision making with information asymmetry and knowledge transportability challenges.
method Developed a sample-efficient algorithm for online learning under these conditions.
result Proved sample complexity of O(1/ε2)O(1/ε^2) for learning an εε-optimal policy.

For a social networking service to acquire and retain users, it must find ways to keep them engaged. By accurately gauging their preferences, it is able to serve them with the subset of available content that maximises revenue for the site. Without the constraints of an appropriate regulatory framework, we argue that a…

2017-01-17abs ↗pdf ↗

Observational learning is a type of learning that occurs as a function of observing, retaining and possibly replicating or imitating the behaviour of another agent. It is a core mechanism appearing in various instances of social learning and has been found to be employed in several intelligent species, including humans…

2017-06-20abs ↗pdf ↗

SINN combines social science and deep learning for predicting opinion dynamics.

problem Predicting opinion dynamics in social networks using traditional models requires extensive calibration with real data.
method SINN integrates theoretical models and social media data using physics-informed neural networks (PINNs) and matrix factorization.
result SINN outperforms six baseline methods in predicting opinion dynamics on real-world and synthetic datasets.

The paper examines how slightly biasing towards under-represented groups in sequential selection processes can lead to long-term fairness.

problem Designing fair sequential decision-making processes for long-term social fairness.
method Proposes Multi-agent Fair-Greedy policy to balance score maximization and fairness.
result Proves convergence to long-term fairness target set by agents when score distributions are identical.