Decentralization of Agenda-Setting Power and Domain-Selective Bridging: Algorithm Design Beyond the Echo Chamber Debate

• URL: http://arxiv.org/abs/2608.04774v1
• Date: Wed, 05 Aug 2026 12:39:22 GMT
• Title: Decentralization of Agenda-Setting Power and Domain-Selective Bridging: Algorithm Design Beyond the Echo Chamber Debate
• Abstract summary: This paper constructs an Agenda Democratization Index that quantities the decentralization of agenda-setting power.<n>We propose domain-selective bridging, which incorporates not only engagement but also bridging into algorithmic scoring functions.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Echo chambers are an inevitable consequence of the human cognitive system being evolutionarily designed to prioritize processing of high-relevance information at the small-group scale, combined with algorithms that optimize engagement as their sole objective. Conventional prescriptions that normatively criticize echo chambers and demand individual behavioral change have low feasibility given these cognitive constraints. This paper constructs an Agenda Democratization Index (ADI) that quantities the decentralization of agenda-setting power using four variables barrier to entry, granularity, interactivity, and feedback resolution and a SocialInformation Health (SIH) model that integrates ADI with the strength of bridging mechanisms. Based on this model, we propose domain-selective bridging, which incorporates not only engagement but also bridging into algorithmic scoring functions, optimizing the bridging weight for each information domain based on variability (V ) and collective scope (S). An agent-based simulation comparing three algorithm designs no bridging, uniform bridging, and domain-selective bridging demonstrated that domain-selective bridging substantially outperforms uniform bridging on a joint efficiency measure (SIH user satisfaction) by a factor whose absolute value is sensitive to Model 1's near-zero user satisfaction, but whose direction and dominance ranking are robust improving information sharing in domains relevant to collective decision-making while maintaining user experience in hobby and lifestyle domains. This paper reframes the echo chamber debate from a normative opposition over whether to eliminate echo chambers to an engineer-ing design problem of in which information domains, to what degree, and through what algorithm design should bridging be implemented.

Related papers

• Partition-Guided Distance Saliency: Bridging Decision and Objective Spaces in Many-Objective Optimization [0.7136933021609075]
  We introduce the Partition-Guided Distance Saliency (PGDS) framework, a novel XAI approach designed for continuous optimization landscapes.<n>First, we employ a surrogate model that learns how geometric distances in the decision space map to proximity in the objective space.<n>Second, to address the difficulty of manual target selection in high dimensions, the framework automatically partitions the objective landscape into distinct regions and identifies local Dominating Points''<n>Third, we quantify how sensitive a solution's position is to each decision variable by measuring the distance shifts induced by perturbations to each variable.
  arXiv  Detail & Related papers  (2026-06-29T19:04:53Z)
• Joint Optimization of Model Partitioning and Resource Allocation for Anti-Jamming Collaborative Inference Systems [52.842088497389746]
  This letter focuses on an anti-jamming collaborative inference system in the presence of a malicious jammer.<n>We first analyze the effects of jamming and DNN partitioning on inference accuracy via data regression.<n>We propose an efficient alternating optimization-based algorithm, which decomposes the problem into three subproblems.
  arXiv  Detail & Related papers  (2026-03-03T03:52:52Z)
• Backscatter Device-aided Integrated Sensing and Communication: A Pareto Optimization Framework [59.30060797118097]
  Integrated sensing and communication (ISAC) systems potentially encounter significant performance degradation in densely obstructed urban non-line-of-sight scenarios.<n>This paper proposes a backscatter approximation (BD)-assisted ISAC system, which leverages passive BDs naturally distributed in environments of enhancement.
  arXiv  Detail & Related papers  (2025-07-12T17:11:06Z)
• NDCG-Consistent Softmax Approximation with Accelerated Convergence [67.10365329542365]
  We propose novel loss formulations that align directly with ranking metrics.<n>We integrate the proposed RG losses with the highly efficient Alternating Least Squares (ALS) optimization method.<n> Empirical evaluations on real-world datasets demonstrate that our approach achieves comparable or superior ranking performance.
  arXiv  Detail & Related papers  (2025-06-11T06:59:17Z)
• An Identifiable Cost-Aware Causal Decision-Making Framework Using Counterfactual Reasoning [18.324601057882386]
  We propose a minimum-cost causal decision (MiCCD) framework via counterfactual reasoning to solve the necessary cause.<n> Emphasis is placed on making counterfactual reasoning processes identifiable in the presence of mixed anomaly data.<n>MiCCD outperforms conventional methods across multiple metrics, including F1-score, cost efficiency, and ranking quality(nDCG@k values)
  arXiv  Detail & Related papers  (2025-05-13T08:41:45Z)
• Coarse Set Theory for AI Ethics and Decision-Making: A Mathematical Framework for Granular Evaluations [0.0]
  Coarse Ethics (CE) is a theoretical framework that justifies coarse-grained evaluations, such as letter grades or warning labels, as ethically appropriate under cognitive and contextual constraints.<n>This paper introduces Coarse Set Theory (CST), a novel mathematical framework that models coarse-grained decision-making using totally ordered structures and coarse partitions.<n>CST defines hierarchical relations among sets and uses information-theoretic tools, such as Kullback-Leibler Divergence, to quantify the trade-off between simplification and information loss.
  arXiv  Detail & Related papers  (2025-02-11T08:18:37Z)
• Dynamic Detection of Relevant Objectives and Adaptation to Preference Drifts in Interactive Evolutionary Multi-Objective Optimization [2.4374097382908477]
  We study the dynamic nature of DM preferences, which can evolve throughout the decision-making process and affect the relevance of objectives. We propose methods to discard outdated or conflicting preferences when such shifts occur. Our experimental results demonstrate that the proposed methods effectively manage evolving preferences and significantly enhance the quality and desirability of the solutions produced by the algorithm.
  arXiv  Detail & Related papers  (2024-11-07T09:09:06Z)
• COT: A Generative Approach for Hate Speech Counter-Narratives via Contrastive Optimal Transport [25.73474734479759]
  This research paper introduces a novel framework based on contrastive optimal transport. It effectively addresses the challenges of maintaining target interaction and promoting diversification in generating counter-narratives. Our proposed model significantly outperforms current methods evaluated by metrics from multiple aspects.
  arXiv  Detail & Related papers  (2024-06-18T06:24:26Z)
• LoRA-Ensemble: Efficient Uncertainty Modelling for Self-Attention Networks [52.46420522934253]
  We introduce LoRA-Ensemble, a parameter-efficient ensembling method for self-attention networks.<n>The method not only outperforms state-of-the-art implicit techniques like BatchEnsemble, but even matches or exceeds the accuracy of an Explicit Ensemble.
  arXiv  Detail & Related papers  (2024-05-23T11:10:32Z)
• Towards Full-scene Domain Generalization in Multi-agent Collaborative Bird's Eye View Segmentation for Connected and Autonomous Driving [49.03947018718156]
  We propose a unified domain generalization framework to be utilized during the training and inference stages of collaborative perception. We also introduce an intra-system domain alignment mechanism to reduce or potentially eliminate the domain discrepancy among connected and autonomous vehicles.
  arXiv  Detail & Related papers  (2023-11-28T12:52:49Z)
• Task-Oriented Sensing, Computation, and Communication Integration for Multi-Device Edge AI [108.08079323459822]
  This paper studies a new multi-intelligent edge artificial-latency (AI) system, which jointly exploits the AI model split inference and integrated sensing and communication (ISAC) We measure the inference accuracy by adopting an approximate but tractable metric, namely discriminant gain.
  arXiv  Detail & Related papers  (2022-07-03T06:57:07Z)
• Decentralized Stochastic Optimization with Inherent Privacy Protection [103.62463469366557]
  Decentralized optimization is the basic building block of modern collaborative machine learning, distributed estimation and control, and large-scale sensing. Since involved data, privacy protection has become an increasingly pressing need in the implementation of decentralized optimization algorithms.
  arXiv  Detail & Related papers  (2022-05-08T14:38:23Z)
• Causal Policy Gradients [6.123324869194195]
  Causal policy gradients (CPGs) provide a common framework for analysing key state-of-the-art algorithms. CPGs are shown to generalise traditional policy gradients, and yield a principled way of incorporating prior knowledge of a problem domain's generative processes.
  arXiv  Detail & Related papers  (2021-02-20T14:51:12Z)
• Communication Efficient Distributed Learning with Censored, Quantized, and Generalized Group ADMM [52.12831959365598]
  We propose a communication-efficiently decentralized machine learning framework that solves a consensus optimization problem defined over a network of inter-connected workers. The proposed algorithm, Censored and Quantized Generalized GADMM, leverages the worker grouping and decentralized learning ideas of Group Alternating Direction Method of Multipliers (GADMM) Numerical simulations corroborate that CQ-GGADMM exhibits higher communication efficiency in terms of the number of communication rounds and transmit energy consumption without compromising the accuracy and convergence speed.
  arXiv  Detail & Related papers  (2020-09-14T14:18:19Z)

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.