Rebalancing Social Feed to Minimize Polarization and Disagreement
- URL: http://arxiv.org/abs/2308.14486v1
- Date: Mon, 28 Aug 2023 10:59:05 GMT
- Title: Rebalancing Social Feed to Minimize Polarization and Disagreement
- Authors: Federico Cinus, Aristides Gionis, Francesco Bonchi
- Abstract summary: We propose a novel problem formulation aimed at slightly nudging users' social feeds in order to strike a balance between relevance and diversity.
Our approach is based on re-weighting the relative importance of the accounts that a user follows, so as to calibrate the frequency with which the content produced by various accounts is shown to the user.
- Score: 24.939887831898453
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Social media have great potential for enabling public discourse on important
societal issues. However, adverse effects, such as polarization and echo
chambers, greatly impact the benefits of social media and call for algorithms
that mitigate these effects. In this paper, we propose a novel problem
formulation aimed at slightly nudging users' social feeds in order to strike a
balance between relevance and diversity, thus mitigating the emergence of
polarization, without lowering the quality of the feed. Our approach is based
on re-weighting the relative importance of the accounts that a user follows, so
as to calibrate the frequency with which the content produced by various
accounts is shown to the user. We analyze the convexity properties of the
problem, demonstrating the non-matrix convexity of the objective function and
the convexity of the feasible set. To efficiently address the problem, we
develop a scalable algorithm based on projected gradient descent. We also prove
that our problem statement is a proper generalization of the undirected-case
problem so that our method can also be adopted for undirected social networks.
As a baseline for comparison in the undirected case, we develop a semidefinite
programming approach, which provides the optimal solution. Through extensive
experiments on synthetic and real-world datasets, we validate the effectiveness
of our approach, which outperforms non-trivial baselines, underscoring its
ability to foster healthier and more cohesive online communities.
Related papers
- A Semidefinite Relaxation Approach for Fair Graph Clustering [1.03590082373586]
This study introduces fair graph clustering within the framework of the disparate impact doctrine.
We employ a semidefinite relaxation approach to approximate the underlying optimization problem.
arXiv Detail & Related papers (2024-10-19T22:51:24Z) - Reconciling Heterogeneous Effects in Causal Inference [44.99833362998488]
We apply the Reconcile algorithm for model multiplicity in machine learning to reconcile heterogeneous effects in causal inference.
Our results have tangible implications for ensuring fair outcomes in high-stakes such as healthcare, insurance, and housing.
arXiv Detail & Related papers (2024-06-05T18:43:46Z) - Reduced-Rank Multi-objective Policy Learning and Optimization [57.978477569678844]
In practice, causal researchers do not have a single outcome in mind a priori.
In government-assisted social benefit programs, policymakers collect many outcomes to understand the multidimensional nature of poverty.
We present a data-driven dimensionality-reduction methodology for multiple outcomes in the context of optimal policy learning.
arXiv Detail & Related papers (2024-04-29T08:16:30Z) - Causal Disentanglement for Regulating Social Influence Bias in Social
Recommendation [12.120586712440673]
Social recommendation systems face the problem of social influence bias, which can lead to an overemphasis on recommending items that friends have interacted with.
We propose a Causal Disentanglement-based framework for Regulating Social influence Bias in social recommendation, named CDRSB, to improve recommendation performance.
arXiv Detail & Related papers (2024-03-06T09:48:48Z) - Decoding the Silent Majority: Inducing Belief Augmented Social Graph
with Large Language Model for Response Forecasting [74.68371461260946]
SocialSense is a framework that induces a belief-centered graph on top of an existent social network, along with graph-based propagation to capture social dynamics.
Our method surpasses existing state-of-the-art in experimental evaluations for both zero-shot and supervised settings.
arXiv Detail & Related papers (2023-10-20T06:17:02Z) - A Unified Framework of Policy Learning for Contextual Bandit with
Confounding Bias and Missing Observations [108.89353070722497]
We study the offline contextual bandit problem, where we aim to acquire an optimal policy using observational data.
We present a new algorithm called Causal-Adjusted Pessimistic (CAP) policy learning, which forms the reward function as the solution of an integral equation system.
arXiv Detail & Related papers (2023-03-20T15:17:31Z) - A Community-Aware Framework for Social Influence Maximization [40.842329580198324]
We consider the Influence Maximization (IM) problem: 'if we can try to convince a subset of individuals in a social network to adopt a new product or innovation, and the goal is to trigger a large cascade of further adoptions, which set of individuals should we target'
We propose a community-aware divide-and-conquer strategy that involves (i) learning the inherent community structure of the social network, (ii) generating candidate solutions by solving the influence problem for each community, and (iii) selecting the final set of individuals from the candidate solutions using a novel progressive budgeting scheme.
arXiv Detail & Related papers (2022-07-18T20:43:17Z) - BayesIMP: Uncertainty Quantification for Causal Data Fusion [52.184885680729224]
We study the causal data fusion problem, where datasets pertaining to multiple causal graphs are combined to estimate the average treatment effect of a target variable.
We introduce a framework which combines ideas from probabilistic integration and kernel mean embeddings to represent interventional distributions in the reproducing kernel Hilbert space.
arXiv Detail & Related papers (2021-06-07T10:14:18Z) - Differentiable Causal Discovery from Interventional Data [141.41931444927184]
We propose a theoretically-grounded method based on neural networks that can leverage interventional data.
We show that our approach compares favorably to the state of the art in a variety of settings.
arXiv Detail & Related papers (2020-07-03T15:19:17Z) - Fair Influence Maximization: A Welfare Optimization Approach [34.39574750992602]
We provide a principled characterization of the properties that a fair influence algorithm should satisfy.
Under this framework, the trade-off between fairness and efficiency can be controlled by a single design aversion parameter.
Our framework encompasses as special cases leximin and proportional fairness.
arXiv Detail & Related papers (2020-06-14T14:08:10Z) - GenDICE: Generalized Offline Estimation of Stationary Values [108.17309783125398]
We show that effective estimation can still be achieved in important applications.
Our approach is based on estimating a ratio that corrects for the discrepancy between the stationary and empirical distributions.
The resulting algorithm, GenDICE, is straightforward and effective.
arXiv Detail & Related papers (2020-02-21T00:27:52Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.