Tracking and Predicting Evolution of Social Communities
研究开发了一种算法框架来追踪和预测社交网络中社区的演变,通过分析社区早期特征预测其寿命。
研究开发了一种算法框架来追踪和预测社交网络中社区的演变,通过分析社区早期特征预测其寿命。
This work investigates the memory–generalization phase transition in diffusion models under varying training data scales. We propose a *correlational memory* perspective: training corresponds to memory encoding, while generation implements memory retrieval. We establish, for the first time, a theoretical connection between diffusion models and Hopfield networks, deriving necessary and sufficient conditions for the emergence of *spurious attractors*—hallucinated states—at the critical memory load threshold. Leveraging energy landscape analysis, dynamical systems modeling, and empirical validation on DDPM and DDIM, we confirm the universality of this phenomenon. Results show that models operate dominantly in memory mode under small-data regimes, shift toward generalization with large-scale data, and exhibit spurious attractors in the critical regime—unifying explanations for memory overload and implicit manifold learning. This work provides a cross-disciplinary theoretical framework and falsifiable predictions for understanding the intrinsic mechanisms of diffusion models.
This work addresses two key challenges in large-model training on analog in-memory computing (AIMC) accelerators: (1) restricted data parallelism due to inefficient weight replication, and (2) stale weights and analog-domain deviations caused by asynchronous pipelined gradient updates. To this end, we propose Analog-SGD-AP—an asynchronous pipelined gradient descent algorithm tailored for AIMC. We establish the first convergence theory for AIMC architectures that jointly models physical non-idealities (e.g., device noise, nonlinear conductance response, weight update latency) and asynchronous timing behavior, rigorously deriving upper bounds on clock cycles and sample complexity. Analog-SGD-AP breaks the traditional data-parallelism bottleneck, enabling scalable multi-chip collaborative training. Evaluated on real datasets, it achieves convergence comparable to digital pipelined training while significantly improving training throughput and hardware efficiency.
Bayesian inference often faces a trade-off between computational efficiency and posterior accuracy, especially across multiple datasets. This paper proposes an adaptive hybrid inference workflow that—uniquely—integrates amortized variational inference (AVI) with Markov chain Monte Carlo (MCMC) in a dynamically coordinated manner. Leveraging principled posterior diagnostics, it constructs a Pareto frontier to enable automatic, optimal switching between AVI and MCMC. Computational reuse and scheduling optimization further boost inference throughput. The method unifies generative neural network modeling, MCMC refinement, and verifiable diagnostic mechanisms. Evaluated on tens of thousands of real and synthetic datasets, it achieves a 3.2× average speedup over standalone AVI or MCMC baselines, while preserving posterior fidelity—reducing KL divergence by 47% and increasing effective sample size (ESS) by 2.8×. This work delivers a scalable, efficient, and trustworthy solution for large-scale Bayesian inference.
本文提出FlowEvo框架,通过在推理时共进化工作流程和技能来解决大型语言模型代理执行复杂任务后无法保留有效程序的问题。
研究通过调查118名学生,探讨了生成式AI在学习中的不同影响,发现早期依赖、认知依赖、学术任务支持等因素与正面或负面影响相关,建议机构制定更好政策以解决不平等问题。
该研究针对拟阵秘书问题,提出了一种竞争比为3.7321的在线算法,通过保留随机样本部分并平衡剩余元素,改进了Singla的4-竞争算法。
针对长时交互工具使用代理的安全校准问题,提出BLINDSPOT基准,通过适应性对抗互动等方法评估完整用户-代理-环境轨迹。
本文研究了在有预测的情况下,如何通过设计策略鲁棒的调度机制来最小化不相关机器上的完工时间。提出了一种名为EdgeSkip的新方法,该方法平衡了预测准确性与最坏情况下的性能。
研究通过随机化RD和PCD机制来解决圆上单设施选址问题,提出的方法对任意数量的代理人实现了3/2的近似比,保证策略性。