中文
相关论文

相关论文: {\alpha}-Indirect Control in Onion-like Networks

200 篇论文

The focus of our work is speeding up evaluation of deep neural networks in retrieval scenarios, where conventional architectures may spend too much time on negative examples. We propose to replace a monolithic network with our novel cascade…

计算机视觉与模式识别 · 计算机科学 2016-08-10 Martin Simonovsky , Nikos Komodakis

In the wake of quantum computing advancements and quantum algorithmic progress, quantum algorithms are increasingly being employed to address a myriad of combinatorial optimization problems. Among these, the Independent Domination Problem…

量子物理 · 物理学 2024-12-31 Haoqian Pan , Changhong Lu

In this paper, we propose a novel online optimization algorithm built by combining ideas from control theory and system identification. The foundation of our algorithm is a control-based design that makes use of the internal model of the…

最优化与控制 · 数学 2025-11-26 Wouter J. A. van Weerelt , Lantian Zhang , Silun Zhang , Nicola Bastianello

Interactions in many real-world phenomena can be explained by a strong hierarchical structure. Typically, this structure or ranking is not known; instead we only have observed outcomes of the interactions, and the goal is to infer the…

数据结构与算法 · 计算机科学 2019-04-24 Nikolaj Tatti

The ability to control a complex network towards a desired behavior relies on our understanding of the complex nature of these social and technological networks. The existence of numerous control schemes in a network promotes us to wonder:…

系统与控制 · 计算机科学 2016-12-01 Xizhe Zhang , Tianyang Lv , Yuanyuan Pu

We survey classical, machine learning, and data-driven system identification approaches to learn control-relevant and physics-informed models of dynamical systems. Recently, machine learning approaches have enabled system identification…

系统与控制 · 电气工程与系统科学 2025-12-09 S. Sivaranjani , Yuanyuan Shi , Nikolay Atanasov , Thai Duong , Jie Feng , Tim Martin , Yuezhu Xu , Vijay Gupta , Frank Allgöwer

Studies have shown that the people depicted in image search results tend to be of majority groups with respect to socially salient attributes. This skew goes beyond that which already exists in the world - e.g., Kay et al. showed that…

机器学习 · 计算机科学 2020-08-18 L. Elisa Celis , Vijay Keswani

A serious challenge when finding influential actors in real-world social networks is the lack of knowledge about the structure of the underlying network. Current state-of-the-art methods rely on hand-crafted sampling algorithms; these…

社会与信息网络 · 计算机科学 2020-02-21 Harshavardhan Kamarthi , Priyesh Vijayan , Bryan Wilder , Balaraman Ravindran , Milind Tambe

Identifying the most influential nodes in information networks has been the focus of many research studies. This problem has crucial applications in various contexts, such as controlling the propagation of viruses or rumours in real-world…

社会与信息网络 · 计算机科学 2022-08-30 Ahmad Asgharian Rezaei , Justin Munoz , Mahdi Jalili , Hamid Khayyam

Quantum Optimal Control (QOC) enables the realization of accurate operations, such as quantum gates, and support the development of quantum technologies. To date, many QOC frameworks have been developed but those remain only naturally…

量子物理 · 物理学 2022-08-01 Frederic Sauvage , Florian Mintert

We introduce the concept of control centrality to quantify the ability of a single node to control a directed weighted network. We calculate the distribution of control centrality for several real networks and find that it is mainly…

物理与社会 · 物理学 2013-01-01 Yang-Yu Liu , Jean-Jacques Slotine , Albert-László Barabási

We present ONION, a multi-layered framework for participatory Entity-Relationship (ER) modeling that integrates insights from design justice, participatory AI, and conceptual modeling. ONION introduces a five-stage methodology: Observe,…

数据库 · 计算机科学 2025-07-14 Viktoriia Makovska , George Fletcher , Julia Stoyanovich

In the classical cake cutting problem, a resource must be divided among agents with different utilities so that each agent believes they have received a fair share of the resource relative to the other agents. We introduce a variant of the…

数据结构与算法 · 计算机科学 2018-02-27 Rediet Abebe , Jon Kleinberg , David Parkes

We study a family online influence maximization problems where in a sequence of rounds $t=1,\ldots,T$, a decision maker selects one from a large number of agents with the goal of maximizing influence. Upon choosing an agent, the decision…

机器学习 · 计算机科学 2021-09-27 Gábor Lugosi , Gergely Neu , Julia Olkhovskaya

With the development of complex networks, many researchers have paid greater attention to studying the control of complex networks over the last decade. Although some theoretical breakthroughs allow us to identify all driver nodes, we still…

物理与社会 · 物理学 2023-04-19 Zhengzhong Yuan , Jingwen Li , Chen Zhao , Li Hu , Zhesi Shen

We consider the problem of selecting $k$ seed nodes in a network to maximize the minimum probability of activation under an independent cascade beginning at these seeds. The motivation is to promote fairness by ensuring that even the least…

We develop an early warning system and subsequent optimal intervention policy to avoid the formation of disproportional dominance (`winner-takes-all') in growing complex networks. This is modeled as a system of interacting agents, whereby…

物理与社会 · 物理学 2020-09-17 Sandro Lera , Alex 'Sandy' Pentland , Didier Sornette

Community discovery in complex networks is an interesting problem with a number of applications, especially in the knowledge extraction task in social and information networks. However, many large networks often lack a particular community…

数据结构与算法 · 计算机科学 2012-06-05 Michele Coscia , Giulio Rossetti , Fosca Giannotti , Dino Pedreschi

Bipartite networks provide an effective resource for representing, characterizing, and modeling several abstract and real-world systems and structures involving binary relations, which include food webs, social interactions, and…

社会与信息网络 · 计算机科学 2024-02-01 Alexandre Benatti , Luciano da F. Costa

We investigate graphs that can be disconnected into small components by removing a vanishingly small fraction of their vertices. We show that when a quantum network is described by such a graph, the network is efficiently controllable, in…

量子物理 · 物理学 2017-07-05 Can Gokler , Seth Lloyd , Peter Shor , Kevin Thompson