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

Semi-supervised Domain Adaptation on Graphs with Contrastive Learning and Minimax Entropy

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Xiao, Jiaren Dai, Quanyu Shen, Xiao Xie, Xiaochen Dai, Jing Lam, James Kwok, Ka-Wai Department of Mechanical Engineering The University of Hong Kong Hong Kong Department of Computing The Hong Kong Polytechnic University Hong Kong School of Computer Science and Technology Hainan University Haikou China Department of Automation Harbin Institute of Technology Shenzhen China Institute for Automatic Control and Complex Systems University of Duisburg-Essen Duisburg Germany

Label scarcity in a graph is frequently encountered in real-world applications due to the high cost of data labeling. To this end, semi-supervised domain adaptation (SSDA) on graphs aims to leverage the knowledge of a labeled source graph to aid in node classification on a target graph with limited labels. SSDA tasks need to overcome the domain gap between the source and target graphs. However, to date, this challenging research problem has yet to be formally considered by the existing approaches designed for cross-graph node classification. This paper proposes a novel method called SemiGCL to tackle the graph Semi-supervised domain adaptation with Graph Contrastive Learning and minimax entropy training. SemiGCL generates informative node representations by contrasting the representations learned from a graph’s local and global views. Additionally, SemiGCL is adversarially optimized with the entropy loss of unlabeled target nodes to reduce domain divergence. Experimental results on benchmark datasets demonstrate that SemiGCL outperforms the state-of-the-art baselines on the SSDA tasks. © 2023, CC BY-NC-ND.

关键词： Entropy

A crossover-based multi-objective discrete particle swarm optimization model for solving multi-modal routing problems

学校读者我要写书评

暂无评论

Decision Analytics Journal 2023年 9卷

作者： Afrasyabi, Parastoo Mesgari, Mohammad Saadi El-kenawy, El-sayed M. Kaveh, Mehrdad Ibrahim, Abdelhameed Khodadadi, Nima Department of Geodesy and Geomatics K. N. Toosi University of Technology Tehran 19967-15433 Iran Department of Communications and Electronics Delta Higher Institute of Engineering and Technology Mansoura 35111 Egypt Computer Engineering and Control Systems Department Faculty of Engineering Mansoura University Mansoura 35516 Egypt Department of Civil and Architectural Engineering University of Miami Coral Gables FL United States

Passengers must use a set of modes and vehicles to reach their destination in complicated urban structures. Choosing an optimal route is a complicated optimization problem for these passengers. This study proposes a multi-objective optimization algorithm to solve the routing problem in the urban multi-modal network. The multi-modal network problem considered in this study is a transportation network with subway, Bus Rapid Transit (BRT), taxi, and walking modes. The objective functions determine the optimized route by considering route length, traffic, comfort, and safety. We develop a Crossover-Based Multi-Objective Discrete Particle Swarm Optimization (CBMODPSO) to solve the problem. CBMODPSO has been improved using mutation and crossover operators. Multi-Objective Artificial Bee Colony (MOABC), Multi-Objective Ant Colony Optimization (MOACO), Multi-Objective Biogeography-Based Optimization (MOBBO), Multi-Objective Gray Wolf Optimization (MOGWO), and Non-dominated Sorting Genetic Algorithm-II (NSGA-II) algorithms are used to evaluate and compare the results from the CBMODPSO algorithm. In addition, CBMODPSO results are compared with previous research results. We show the improved algorithm is more repeatable than other algorithms. The CBMODPSO algorithm has a faster convergence rate and is able to get to an optimal solution in a smaller generation number and much less time. The CBMODPSO algorithm is implemented in about one-thirties of the MOBBO duration. Meanwhile, it has a reproducibility of almost twice the MOGWO algorithm. © 2023 The Author(s)

关键词： Discrete particle swarm optimization Meta-heuristic algorithms Multi-modal routing Smart traffic Transportation network

Robust Continuous-Time Generation Scheduling under Power Demand Uncertainty: An Affine Decision Rule Approach

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Cho, Youngchae Yang, Insoon Ishizaki, Takayuki Department of Systems and Control Engineering Institute of Science Tokyo Tokyo Japan Department of Electrical and Computer Engineering ASRI Seoul National University Seoul Korea Republic of

Most existing generation scheduling models for power systems under demand uncertainty rely on energy-based formulations with a finite number of time periods, which may fail to ensure that power supply and demand are balanced continuously over time. To address this issue, we propose a robust generation scheduling model in a continuous-time framework, employing a decision rule approach. First, for a given set of demand trajectories, we formulate a general robust generation scheduling problem to determine a decision rule that maps these demand trajectories and time points to the power outputs of generators. Subsequently, we derive a surrogate of it as our model by carefully designing a class of decision rules that are affine in the current demand, with coefficients invariant over time and constant terms that are continuous piecewise affine functions of time. As a result, our model can be recast as a finite-dimensional linear program to determine the coefficients and the function values of the constant terms at each breakpoint, solvable via the cutting-plane method. Our model is non-anticipative unlike most existing continuous-time models, which use Bernstein polynomials, making it more practical. We also provide illustrative numerical examples. Copyright © 2025, The Authors. All rights reserved.

关键词： Continuous time systems

Newton and interior-point methods for (constrained) nonconvex-nonconcave minmax optimization with stability and instability guarantees

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Chinchilla, Raphael Yang, Guosong Hespanha, João P. Center for Control Dynamical Systems and Computation University of California Santa BarbaraCA93106 United States Department of Electrical and Computer Engineering Rutgers University New BrunswickNJ08854 United States

We address the problem of finding a local solution to a nonconvex-nonconcave minmax optimization using Newton type methods, including primal-dual interior-point ones. The first step in our approach is to analyze the local convergence properties of Newton’s method in nonconvex minimization. It is well established that Newton’s method iterations are attracted to any point with a zero gradient, irrespective of it being a local minimum. From a dynamical system standpoint, this occurs because every point for which the gradient is zero is a locally asymptotically stable equilibrium point. We show that by adding a multiple of the identity such that the Hessian matrix is always positive definite, we can ensure that every non-local-minimum equilibrium point becomes unstable (meaning that the iterations are no longer attracted to such points), while local minima remain locally asymptotically stable. Building on this foundation, we develop Newton-type algorithms for minmax optimization, conceptualized as a sequence of local quadratic approximations for the minmax problem. Using a local quadratic approximation serves as a surrogate for guiding the modified Newton’s method towards a solution. For these local quadratic approximations to be well-defined, it is necessary to modify the Hessian matrix by adding a diagonal matrix. We demonstrate that, for an appropriate choice of this diagonal matrix, we can guarantee the instability of every non-local-minmax equilibrium point while maintaining stability for local minmax points. Using numerical examples, we illustrate the importance of guaranteeing the instability property. While our results are about local convergence, the numerical examples also indicate that our algorithm enjoys good global convergence properties. © 2022, CC BY.

关键词： Stability

A Multi-population Integrated Approach for Capacitated Location Routing

学校读者我要写书评

暂无评论

arXiv 2024年

作者： He, Pengfei Hao, Jin-Kao Wu, Qinghua School of Automation Key Laboratory of Measurement and Control of Complex Systems of Engineering Ministry of Education Southeast University Nanjing210096 China Department of Computer Science LERIA University of Angers 2 Boulevard Lavoisier Angers49045 France School of Management Huazhong University of Science and Technology No. 1037 Luoyu Road Wuhan China

The capacitated location-routing problem involves determining the depots from a set of candidate capacitated depot locations and finding the required routes from the selected depots to serve a set of customers whereas minimizing a cost function that includes the cost of opening the chosen depots, the fixed utilization cost per vehicle used, and the total cost (distance) of the routes. This paper presents a multi-population integrated framework in which a multi-depot edge assembly crossover generates promising offspring solutions from the perspective of both depot location and route edge assembly. The method includes an effective neighborhood-based local search, a feasibility-restoring procedure and a diversification-oriented mutation. Of particular interest is the multi-population scheme which organizes the population into multiple subpopulations based on depot configurations. Extensive experiments on 281 benchmark instances from the literature show that the algorithm performs remarkably well, by improving 101 best-known results (new upper bounds) and matching 84 best-known results. Additional experiments are presented to gain insight into the role of the key elements of the algorithm. © 2024, CC BY-NC-ND.

关键词： Cost functions

Cluster Synchronization of Kuramoto Oscillators via Pacemakers and Mean-phase Feedback control

学校读者我要写书评

暂无评论

Cluster Synchronization of Kuramoto Oscillators via Pacemake...

IEEE Conference on Decision and control

作者： Ryota Kokubo Mitsuaki Matsubara Rui Kato Hideaki Ishii Department of Computer Science Tokyo Institute of Technology Yokohama Japan Department of Systems and Control Engineering Tokyo Institute of Technology Yokohama Japan Laboratoire d’Automatique de Génie des Procédés et de Génie Pharmaceutique (LAGEPP) Université Claude Bernard Lyon 1 Villeurbanne France Department of Information Physics and Computing The University of Tokyo Tokyo Japan

ISBN: (数字)9798350316339

ISBN: (纸本)9798350316346

Brain networks typically exhibit characteristic synchronization patterns where several synchronized clusters coexist. On the other hand, neurological disorders are considered to be related to pathological synchronization such as excessive synchronization of large populations of neurons. Motivated by these phenomena, this paper presents two approaches to control the cluster synchronization of Kuramoto oscillators. One is based on the use of pacemakers to the clusters, and the other is based on feeding back the mean phases to the clusters. We first show conditions on the pacemaker weights and the feedback gains for the network to achieve cluster synchronization. Then, we propose a method to find optimal feedback gains through convex optimization. A numerical example demonstrates the effectiveness of the proposed methods.

关键词： Neurological diseases Hands Pathology Design methodology Neurons Pacemakers Convex functions Feedback control Synchronization Oscillators

Automated Leukemia Screening and Sub-types Classification Using Deep Learning

学校读者我要写书评

暂无评论

computer systems Science & engineering 2023年第9期46卷 3541-3558页

作者： Chaudhary Hassan Abbas Gondal Muhammad Irfan Sarmad Shafique Muhammad Salman Bashir Mansoor Ahmed Osama M.Alshehri Hassan H.Almasoudi Samar M.Alqhtani Mohammed M.Jalal Malik A.Altayar Khalaf F.Alsharif Department of Computer Science COMSATS University Islamabad44000Pakistan Electrical Engineering Department College of EngineeringNajran UniversityNajran61441Saudi Arabia Control Automotive and Robotics LabNational Center of Robotics and Automation(NCRA HEC)MirpurPakistan Mirpur University of Science and Technology(MUST)MirpurPakistan Department of Computer Science Virtual University of PakistanLahore54000Pakistan Department of Clinical Laboratory Sciences College of Applied Medical SciencesNajran UniversityNajran61441Saudi Arabia Department of Information Systems College of Computer Science and Information SystemsNajran UniversityNajran61441Saudi Arabia Department of Medical Laboratory Technology Faculty of Applied Medical SciencesUniversity of TabukTabukSaudi Arabia Department of Clinical Laboratory Sciences College of Applied Medical SciencesTaif UniversityP.O.Box 11099Taif21944Saudi Arabia

Leukemia is a kind of blood cancer that damages the cells in the blood and bone marrow of the human *** produces cancerous blood cells that disturb the human’s immune system and significantly affect bone marrow’s production ability to effectively create different types of blood cells like red blood cells(RBCs)and white blood cells(WBC),and *** can be diagnosed manually by taking a complete blood count test of the patient’s blood,from which medical professionals can investigate the signs of leukemia ***,two other methods,microscopic inspection of blood smears and bone marrow aspiration,are also utilized while examining the patient for ***,all these methods are labor-intensive,slow,inaccurate,and require a lot of human experience and *** authors have proposed automated detection systems for leukemia diagnosis to overcome these *** have deployed digital image processing and machine learning algorithms to classify the cells into normal and blast ***,these systems are more efficient,reliable,and fast than previous manual diagnosing ***,more work is required to classify leukemia-affected cells due to the complex characteristics of blood images and leukemia cells having much intra-class variability and inter-class *** this paper,we have proposed a robust automated system to diagnose leukemia and its *** have classified ALL into its sub-types based on FAB classification,i.e.,L1,L2,and L3 types with better *** have achieved 96.06%accuracy for subtypes classification,which is better when compared with the state-of-the-art methodologies.

关键词： Healthcare cancer detection deep learning convolutional neural network

Non-Euclidean Monotone Operator Theory with Applications to Recurrent Neural Networks

学校读者我要写书评

暂无评论

Non-Euclidean Monotone Operator Theory with Applications to ...

IEEE Conference on Decision and control

作者： Alexander Davydov Saber Jafarpour Anton V. Proskurnikov Francesco Bullo Center for Control Dynamical Systems and Computation University of California Santa Barbara USA School of Electrical and Computer Engineering Georgia Institute of Technology Department of Electronics and Telecommunications Politecnico di Torino Turin Italy

ISBN: (数字)9781665467612

ISBN: (纸本)9781665467629

We provide a novel transcription of monotone operator theory to the non-Euclidean finite-dimensional spaces ℓ 1 and ℓ ∞ . We first establish properties of mappings which are monotone with respect to the non-Euclidean norms ℓ 1 or ℓ ∞ . In analogy with their Euclidean counterparts, mappings which are monotone with respect to a non-Euclidean norm are amenable to numerous algorithms for computing their zeros. We demonstrate that several classic iterative methods for computing zeros of monotone operators are directly applicable in the non-Euclidean framework. We present a case-study in the equilibrium computation of recurrent neural networks and demonstrate that casting the computation as a suitable operator splitting problem improves convergence rates.

关键词： Casting Analytical models Recurrent neural networks Machine learning Aerospace electronics control systems Robustness

Non-Euclidean Monotone Operator Theory and Applications

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Davydov, Alexander Jafarpour, Saber Proskurnikov, Anton V. Bullo, Francesco Center for Control Dynamical Systems and Computation University of California Santa Barbara Santa BarbaraCA93106-5070 United States Department of Electrical Computer and Energy Engineering University of Colorado BoulderCO80309-0020 United States Department of Electronics and Telecommunications Politecnico di Torino Turin10129 Italy

While monotone operator theory is often studied on Hilbert spaces, many interesting problems in machine learning and optimization arise naturally in finite-dimensional vector spaces endowed with non-Euclidean norms, such as diagonally-weighted 1 or ∞ norms. This paper provides a natural generalization of monotone operator theory to finite-dimensional non-Euclidean spaces. The key tools are weak pairings and logarithmic norms. We show that the resolvent and reflected resolvent operators of non-Euclidean monotone mappings exhibit similar properties to their counterparts in Hilbert spaces. Furthermore, classical iterative methods and splitting methods for finding zeros of monotone operators are shown to converge in the non-Euclidean case. We apply our theory to equilibrium computation and Lipschitz constant estimation of recurrent neural networks, obtaining novel iterations and tighter upper bounds via forward-backward splitting. © 2023, CC BY.

关键词： Recurrent neural networks