12:30
12:30
12:30
12:30
On the Limits of PAC Learning Opinion Dynamics
Abstract
Agents in social networks with threshold-based dynamics change opinions when influenced by sufficiently many peers. Existing literature typically assumes that the network structure and dynamics are fully known, which is often unrealistic. In this work, we ask how to learn a network structure from samples of the agents' synchronous opinion updates. Firstly, if the opinion dynamics follow a threshold rule where a fixed number of influencers prevent opinion change (e.g., unanimity and quasi-unanimity), we give an efficient PAC learning algorithm provided that the number of influencers per agent is bounded. Secondly, under standard computational complexity assumptions, we prove that if the opinion of agents follows the majority of their influencers, then there is no efficient PAC learning algorithm. We propose a polynomial-time heuristic that successfully learns consistent networks in over 97% of our simulations on random graphs, with no failures for some specified conditions on the numbers of agents and opinion diffusion examples.
12:00
DecepTIV: A Large-Scale Benchmark for Robust Detection of T2V and I2V Synthetic Videos
Abstract
We are excited to say that registration for PiFORUM25 - The Piscopia Initiative's annual student-led conference - is NOW OPEN!
Register here: https://forms.gle/GF1FtCCKQ7gLiDyV7
PiFORUM25 is our 5th anniversary conference aimed at women and underrepresented genders within mathematics, statistics and related disciplines. This year PiFORUM will be held on *4th-5th September at Queen Mary University of London*, Mathematical Sciences Building.