Simple Opinion Dynamics for No-Regret Learning
Fuente:
arXiv
Saved in:
| Main Authors: | Lazarsfeld, John, Alistarh, Dan |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Learning-Augmented Competitive Algorithms for Spatiotemporal Online Allocation with Deadline Constraints
by: Lechowicz, Adam, et al.
Published: (2024)
by: Lechowicz, Adam, et al.
Published: (2024)
A Simple and Robust Protocol for Distributed Counting
by: Cohen, Edith, et al.
Published: (2025)
by: Cohen, Edith, et al.
Published: (2025)
A Simple Distributed Deterministic Planar Separator
by: Abd-Elhaleem, Yaseen, et al.
Published: (2026)
by: Abd-Elhaleem, Yaseen, et al.
Published: (2026)
PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search
by: Yu, Shangdi, et al.
Published: (2023)
by: Yu, Shangdi, et al.
Published: (2023)
Distributed clustering in partially overlapping feature spaces
by: Maritan, Alessio, et al.
Published: (2025)
by: Maritan, Alessio, et al.
Published: (2025)
GreedyML: A Parallel Algorithm for Maximizing Constrained Submodular Functions
by: Gopal, Shivaram, et al.
Published: (2024)
by: Gopal, Shivaram, et al.
Published: (2024)
Scalable Distributed Algorithms for Size-Constrained Submodular Maximization in the MapReduce and Adaptive Complexity Models
by: Chen, Yixin, et al.
Published: (2022)
by: Chen, Yixin, et al.
Published: (2022)
A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems
by: Li, Qian, et al.
Published: (2024)
by: Li, Qian, et al.
Published: (2024)
A Simple $(1-ε)$-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching
by: Assadi, Sepehr
Published: (2023)
by: Assadi, Sepehr
Published: (2023)
Optimal local certification on graphs of bounded pathwidth
by: Baterisna, Dan Alden, et al.
Published: (2025)
by: Baterisna, Dan Alden, et al.
Published: (2025)
Parallel Dynamic Maximal Matching
by: Ghaffari, Mohsen, et al.
Published: (2024)
by: Ghaffari, Mohsen, et al.
Published: (2024)
Dynamic Maximal Matching in Clique Networks
by: Li, Minming, et al.
Published: (2024)
by: Li, Minming, et al.
Published: (2024)
Efficient Dynamic MaxFlow Computation on GPUs
by: Kannappan, Shruthi, et al.
Published: (2025)
by: Kannappan, Shruthi, et al.
Published: (2025)
Parallel Batch-Dynamic Maximal Independent Set
by: Blelloch, Guy, et al.
Published: (2026)
by: Blelloch, Guy, et al.
Published: (2026)
Parallel and (Nearly) Work-Efficient Dynamic Programming
by: Ding, Xiangyun, et al.
Published: (2024)
by: Ding, Xiangyun, et al.
Published: (2024)
An Implementation and Experimental Comparison of Dynamic Ordered Sets
by: Malek, Jordan
Published: (2024)
by: Malek, Jordan
Published: (2024)
Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering
by: De Man, Quinten, et al.
Published: (2025)
by: De Man, Quinten, et al.
Published: (2025)
Evaluation of Dynamic Vector Bin Packing for Virtual Machine Placement
by: Lee, Zong Yu, et al.
Published: (2026)
by: Lee, Zong Yu, et al.
Published: (2026)
A $(3+\varepsilon)$-Approximate Correlation Clustering Algorithm in Dynamic Streams
by: Cambus, Mélanie, et al.
Published: (2022)
by: Cambus, Mélanie, et al.
Published: (2022)
Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation
by: Blelloch, Guy, et al.
Published: (2026)
by: Blelloch, Guy, et al.
Published: (2026)
Parallel Batch-Dynamic Maximal Matching with Constant Work per Update
by: Blelloch, Guy E., et al.
Published: (2025)
by: Blelloch, Guy E., et al.
Published: (2025)
Parallel Sampling via Autospeculation
by: Anari, Nima, et al.
Published: (2025)
by: Anari, Nima, et al.
Published: (2025)
Parallel Batch Dynamic Vertex Coloring in $O(\log Δ)$ Amortized Update Time
by: Hutton, Chase, et al.
Published: (2025)
by: Hutton, Chase, et al.
Published: (2025)
Fully-Distributed Byzantine Agreement in Sparse Networks
by: Augustine, John, et al.
Published: (2024)
by: Augustine, John, et al.
Published: (2024)
Distributed Download from an External Data Source in Faulty Majority Settings
by: Augustine, John, et al.
Published: (2024)
by: Augustine, John, et al.
Published: (2024)
Vertical Federated Learning with Missing Features During Training and Inference
by: Valdeira, Pedro, et al.
Published: (2024)
by: Valdeira, Pedro, et al.
Published: (2024)
Gradient-less Federated Gradient Boosting Trees with Learnable Learning Rates
by: Ma, Chenyang, et al.
Published: (2023)
by: Ma, Chenyang, et al.
Published: (2023)
Communication-efficient Vertical Federated Learning via Compressed Error Feedback
by: Valdeira, Pedro, et al.
Published: (2024)
by: Valdeira, Pedro, et al.
Published: (2024)
A Multi-Token Coordinate Descent Method for Semi-Decentralized Vertical Federated Learning
by: Valdeira, Pedro, et al.
Published: (2023)
by: Valdeira, Pedro, et al.
Published: (2023)
Asynchronous Opinion Dynamics in Social Networks
by: Berenbrink, Petra, et al.
Published: (2022)
by: Berenbrink, Petra, et al.
Published: (2022)
Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
by: Chang, Yi-Jun
Published: (2023)
by: Chang, Yi-Jun
Published: (2023)
DAG-Inducing Problems and Algorithms
by: Gupta, Arya Tanmay, et al.
Published: (2023)
by: Gupta, Arya Tanmay, et al.
Published: (2023)
The Online Pause and Resume Problem: Optimal Algorithms and An Application to Carbon-Aware Load Shifting
by: Lechowicz, Adam, et al.
Published: (2023)
by: Lechowicz, Adam, et al.
Published: (2023)
Parallel Algorithms for Hierarchical Nucleus Decomposition
by: Shi, Jessica, et al.
Published: (2023)
by: Shi, Jessica, et al.
Published: (2023)
Selective Population Protocols
by: Gańczorz, Adam, et al.
Published: (2023)
by: Gańczorz, Adam, et al.
Published: (2023)
The Art of the Fugue: Minimizing Interleaving in Collaborative Text Editing
by: Weidner, Matthew, et al.
Published: (2023)
by: Weidner, Matthew, et al.
Published: (2023)
Improved Approximation Bounds for Minimum Weight Cycle in the CONGEST Model
by: Manoharan, Vignesh, et al.
Published: (2023)
by: Manoharan, Vignesh, et al.
Published: (2023)
A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model
by: Chang, Yi-Jun, et al.
Published: (2023)
by: Chang, Yi-Jun, et al.
Published: (2023)
Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights
by: Ashvinkumar, Vikrant, et al.
Published: (2023)
by: Ashvinkumar, Vikrant, et al.
Published: (2023)
Eventually Lattice-Linear Algorithms
by: Gupta, Arya Tanmay, et al.
Published: (2023)
by: Gupta, Arya Tanmay, et al.
Published: (2023)
Similar Items
-
Learning-Augmented Competitive Algorithms for Spatiotemporal Online Allocation with Deadline Constraints
by: Lechowicz, Adam, et al.
Published: (2024) -
A Simple and Robust Protocol for Distributed Counting
by: Cohen, Edith, et al.
Published: (2025) -
A Simple Distributed Deterministic Planar Separator
by: Abd-Elhaleem, Yaseen, et al.
Published: (2026) -
PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search
by: Yu, Shangdi, et al.
Published: (2023) -
Distributed clustering in partially overlapping feature spaces
by: Maritan, Alessio, et al.
Published: (2025)