检索结果-内蒙古大学图书馆

arXiv 2024年

作者： Tang, Qian Gu, Yuwen Wang, Boxiang Department of Statistics and Actuarial Science University of Iowa United States Department of Statistics University of Connecticut United States

Quantile regression is a powerful tool for robust and heterogeneous learning that has seen applications in a diverse range of applied areas. However, its broader application is often hindered by the substantial computational demands arising from the non-smooth quantile loss function. In this paper, we introduce a novel algorithm named fastkqr, which significantly advances the computation of quantile regression in reproducing kernel Hilbert spaces. The core of fastkqr is a finite smoothing algorithm that magically produces exact regression quantiles, rather than approximations. To further accelerate the algorithm, we equip fastkqr with a novel spectral technique that carefully reutilizes matrix computations. In addition, we extend fastkqr to accommodate a flexible kernel quantile regression with a data-driven crossing penalty, addressing the interpretability challenges of crossing quantile curves at multiple levels. We have implemented fastkqr in a publicly available R package. Extensive simulations and real applications show that fastkqr matches the accuracy of state-of-the-art algorithms but can operate up to an order of magnitude faster. © 2024, CC BY-NC-SA.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

A Unified algorithmic Framework for Dynamic Assortment Optimization under MNL Choice

arXiv

引用

arXiv 2024年

作者： Sun, Shuo Udwani, Rajan Shen, Zuo-Jun Max Department of Industrial Engineering and Operations Research UC Berkeley BerkeleyCA94720 United States Faculty of Engineering Faculty of Business and Economics University of Hong Kong Hong Kong

We consider assortment and inventory planning problems with dynamic stockout-based substitution effects, and without replenishment, in two different settings: (1) Customers can see all available products when they arrive, a typical scenario in physical stores. (2) The seller can choose to offer a subset of available products to each customer, which is more common on online platforms. Both settings are known to be computationally challenging, and the current approximation algorithms for the two settings are quite different. We develop a unified algorithm framework under the MNL choice model for both settings. Our algorithms improve on the state-of-the-art algorithms in terms of approximation guarantee and runtime, and the ability to manage uncertainty in the total number of customers and handle more complex constraints. In the process, we establish various novel properties of dynamic assortment planning (for the MNL choice model) that may be useful more broadly. Copyright © 2024, The Authors. All rights reserved.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Pointing consensus and Bearing-Based Solutions to the Fermat-Weber Location Problem

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2020年第6期65卷 2339-2354页

作者： Trinh, Minh Hoang Zelazo, Daniel Ahn, Hyo-Sung Hanoi Univ Sci & Technol Dept Automat Control Sch Elect Engn Hanoi 11615 Vietnam Technion Israel Inst Technol Fac Aerosp Engn IL-32000 Haifa Israel Gwangju Inst Sci & Technol Sch Mech Engn Gwangju 61005 South Korea

The pointing consensus problem asks each agent in a multiagent system to agree on their headings toward a common target. This paper proposes a decentralized approach to the pointing consensus problem by simultaneously solving three smaller problems: bearing-only measurement based network localization, target decision, and heading coordination. The proposed solution guarantees that all agents' headings almost globally asymptotically target any weighted centroid of the agents' positions. Furthermore, based on this approach, two decentralized solutions for the Fermat-Weber location problem are proposed and analyzed. Simulation results are also provided to support the analysis.

关键词： Cameras Heuristic algorithms Estimation consensus algorithm Position measurement Symmetric matrices Multi-agent systems Bearing-only measurements decentralized control Fermat-Weber location problem (FWLP) multiagent systems network localization

来源：评论

学校读者我要写书评

暂无评论

A general discrete-time method to achieve resilience in consensus algorithms

A general discrete-time method to achieve resilience in cons...

引用

IEEE Conference on Decision and Control

作者： Guilherme Ramos Daniel Silvestre Carlos Silvestre Faculty of Engineering University of Porto Portugal

ISBN: (数字)9781728174471

ISBN: (纸本)9781728174488

In this paper, we approach the problem of a set of network agents reaching resilient consensus in the presence of a subset of attacked nodes. We devise a generalized method, with polynomial time complexity, which receives as input a discrete-time, synchronous-communication consensus algorithm, a dynamic network of agents, and the maximum number of attacked nodes. The distributed algorithm enables each normal node to detect and discard the values of the attacked agents while reaching the consensus of normal agents for the input consensus algorithm. Hence, the proposed method adds an extra layer of resilience to a given discrete-time and synchronous-communication consensus algorithm. Finally, we demonstrate the effectiveness of the method with experimental results, showing some attack circumstances which we can counter, where the state-of-the-art methods fail.

关键词： Resilience consensus algorithm Heuristic algorithms Optimization Convergence Time complexity Robots

来源：评论

学校读者我要写书评

暂无评论

Constrained consensus-based Iterative algorithm for Economic Dispatch in Power Systems

Constrained Consensus-based Iterative Algorithm for Economic...

引用

Annual Conference of Industrial Electronics Society

作者： Xiao-Kang Liu Jiaqi Yan Lantao Xing Changyun Wen School of Electrical & Electronic Engineering Nanyang Technological University Singapore

ISBN: (数字)9781728154145

ISBN: (纸本)9781728154152

This paper considers the distributed economic dispatch problem in power systems. A novel constrained consensus-based iterative algorithm is proposed to cooperatively search the optimal incremental cost. The algorithm is carried out by alternately executing a continuous-time finite-time consensus algorithm and employing local projection operations only when consensus variables reach agreement. At each iteration, the initial values of consensus variables are restored locally based on the deviation between the consensus value in the last iteration and its projection on local constraints. Compared to existing methods, our method only needs a single consensus algorithm and does not require continuous projection operations. Thus each node in our algorithm only transmits a single variable to neighbours and the search time of the optimal solution is significantly reduced. Convergence analysis is given, and numerical examples are presented to show the effectiveness of our method with comparison to some existing results.

关键词： consensus algorithm Power generation Generators Heuristic algorithms Convergence Power demand Economics

来源：评论

学校读者我要写书评

暂无评论

Droop-based consensus control scheme for economic dispatch in islanded microgrids

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2020年第20期14卷 4529-4538页

作者： Zheng, Shunwei Liao, Kai Yang, Jianwei He, Zhengyou Southwest Jiaotong Univ Sch Elect Engn Chengdu Peoples R China

In this study, a droop-based consensus control scheme (DCCS) is proposed to realise economic dispatch for islanded microgrids in a fully distributed manner. Different from the existing consensus-based approaches, the proposed DCCS embeds droop control into the consensus algorithm, which utilises the neighbouring incremental cost information andP-fdroop control to realise economic dispatch for islanded microgrids. The implementation of the proposed DCCS only needs local measurements and transmitting incremental cost information among neighbouring distributed generations (DGs) through a unidirectional ring communication network (URCN), which does not require any additional conditions (such as leader DG, power mismatch estimation, etc.). Besides, the URCN in the proposed DCCS can efficiently reduce the communication burden compared with the existing consensus-based algorithms implemented in an undirected manner. Furthermore, the theoretical deduction is given to demonstrate the effectiveness of the proposed DCCS. Several simulations show an excellent performance of the proposed DCCS against sudden load and source changes, and the ability to maintain the steady operation even with communication failure.

关键词： distributed power generation power distribution faults load dispatching power distribution economics economic dispatch islanded microgrids DCCS local measurements neighbouring distributed generations consensus-based algorithms droop-based consensus control scheme fully distributed manner consensus-based approaches droop control consensus algorithm neighbouring incremental cost information incremental cost information

来源：评论

学校读者我要写书评

暂无评论

Analysis of Teaching Mode of Music Major Students Based on Personalized Recommendation algorithm

引用

International Journal of High Speed Electronics and Systems 2024年第0期

作者： Wang, Hua Education Science and Music School Luoyang Institute of Science and Technology Luoyang471023 China

With the advent of the era of big data, the teaching practice model of music major has also changed. The emergence and growth of social media allow users to act freely. Therefore, on the basis of social tagging, this paper makes full use of the personalized description information and project content information carried by tags in collaborative tagging. A personalized music recommendation algorithm based on social networks is proposed. In social networks, complex interactive relationships are formed between users and music content, as well as between users themselves. By analyzing users' historical behavior data (such as receiving and listening to playlists, liking, and sharing), we can calculate the similarity between users. For example, if two users frequently listen to the same song or artist, then their similarity is higher. Restart type random walk is an algorithm that iteratively searches on a graph, adding a "restart"mechanism to the traditional random walk. Specifically, during each walk, the algorithm has a certain probability (usually a preset small value, such as 0.15) to return to the starting node, rather than continuing to randomly select the next adjacent node. This mechanism helps the algorithm to explore new nodes while maintaining attention to the starting node, thereby avoiding getting stuck in local optima. A personalized mobile music recommendation algorithm based on the music genome is proposed based on the similarity of the node structure of two graphs and the random walk of restart type. Based on the similarity of interests between different users, a personalized mobile music recommendation algorithm is proposed to realize the personalized service of mobile terminals. © 2025 World Scientific Publishing Company.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

consensus mechanism of virtual power plant transaction blockchain based on credit value

Consensus mechanism of virtual power plant transaction block...

引用

Science and Technology Innovation (IAECST), International Academic Exchange Conference on

作者： Jiani Xiang Jianli Zhao Wenjuan Zhou Di Wang Qian Ai Shuangrui Yin Lei Qi State Grid Shanghai Electric Power Company Shanghai China Shanghai Key Laboratory of Smart Grid Demand Response Shanghai China School of Electronic Information and Electrical Engineering Shanghai Jiaotong University Shanghai China

In the trusted transaction of virtual power plants based on the blockchain, the safe, efficient and flexible consensus mechanism is the key to determine the development of the future blockchain trading system. In order to meet the requirements of privacy and efficiency of power data consensus, a distributed consensus mechanism VPP-PBFT suitable for virtual power plant transaction blockchain is proposed. Firstly, a multi-agent based trusted transaction architecture of virtual power plant blockchain is designed to meet the transaction needs under large-scale node access. Secondly, credit evaluation indicators of market entities are designed, and a distributed consensus mechanism VPP-PBFT is proposed for virtual power plant transactions. Based on the credit value, system selection and node status change are realized, and monitoring node consensus process is added. Based on this, the consistency protocol of traditional PBFT consensus algorithm is simplified. The simulation of the example shows that VPP-PBFT consensus mechanism has the ability to judge the credit of market entities, improve the efficiency of consensus on the premise of ensuring the reliability of consensus, meet the transaction requirements of virtual power plants, and encourage market entities to maintain their own credit.

关键词： Technological innovation Data privacy consensus algorithm Virtual power plants Elasticity consensus protocol Reliability

来源：评论

学校读者我要写书评

暂无评论

Irreversible swap algorithms for soft sphere glasses

arXiv

引用

arXiv 2025年

作者： Nishikawa, Yoshihiko Ghimenti, Federico Berthier, Ludovic van Wijland, Frédéric Department of Physics Kitasato University Kanagawa Sagamihara252-0373 Japan Graduate School of Information Sciences Tohoku University Miyagi Sendai980-8579 Japan Paris75013 France Department of Applied Physics Stanford University 348 Via Pueblo StanfordCA94305 United States Gulliver UMR CNRS 7083 ESPCI Paris PSL Research University Paris75005 France Yukawa Institute for Theoretical Physics Kyoto University Kitashirakawaoiwake-cho Sakyo-ku Kyoto606-8502 Japan

We extend to soft repulsive interaction potentials a recently proposed irreversible swap algorithm originally designed for polydisperse hard spheres. The original algorithm performs rejection-free, irreversible, collective swap moves. We show that event-driven cluster updates of particle diameters can also be performed in continuous potentials by introducing a factorised Metropolis probability. However, the Metropolis factorisation needed to deal with continuous potentials decreases the efficiency of the algorithm and mitigates the benefits of breaking detailed balance. This leads us to propose another irreversible swap algorithm using the standard Metropolis probability that accelerates the relaxation of soft sphere glasses at low temperatures, compared to the original swap algorithm. We apply these efficient swap algorithms to produce very stable inherent structures with vibrational density of states lacking the quasi-localised excitations observed in conventional glasses. © 2025, CC BY.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Douglas-Rachford algorithm for nonmonotone multioperator inclusion problems

arXiv

引用

arXiv 2025年

作者： Alcantara, Jan Harold Takeda, Akiko Center for Advanced Intelligence Project RIKEN Tokyo Japan Department of Mathematical Informatics Graduate School of Information Science and Technology University of Tokyo Tokyo Japan

The Douglas-Rachford algorithm is a classic splitting method for finding a zero of the sum of two maximal monotone operators. It has also been applied to settings that involve one weakly and one strongly monotone operator. In this work, we extend the Douglas-Rachford algorithm to address multioperator inclusion problems involving m (m ≥ 2) weakly and strongly monotone operators, reformulated as a two-operator inclusion in a product space. By selecting appropriate parameters, we establish the convergence of the algorithm to a fixed point, from which solutions can be extracted. Furthermore, we illustrate its applicability to sum-of-m-functions minimization problems characterized by weakly convex and strongly convex functions. For general nonconvex problems in finite-dimensional spaces, comprising Lipschitz continuously differentiable functions and a proper closed function, we provide global subsequential convergence *** Codes 47H10, 49M27 © 2025, CC BY.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：