Weakly acyclic games generalize potential games and are fundamental to the study of game theoretic control. In this paper, we present a generalization of weakly acyclic games, and we observe its importance in multi-ag...
详细信息
ISBN:
(数字)9798350316339
ISBN:
(纸本)9798350316346
Weakly acyclic games generalize potential games and are fundamental to the study of game theoretic control. In this paper, we present a generalization of weakly acyclic games, and we observe its importance in multi-agent learning when agents employ experimental strategy updates in periods where they fail to best respond. While weak acyclicity is defined in terms of path connectivity properties of a game’s better response graph, our generalization is defined using a generalized better response graph. We provide sufficient conditions for this notion of generalized weak acyclicity in both two-player games and n-player games. To demonstrate that our generalization is not trivial, we provide examples of games admitting a pure Nash equilibrium that are not generalized weakly acyclic. The generalization presented in this work is closely related to the recent theory of satisficing paths, and the counterexamples presented here constitute the first negative results in that theory.
We give a proof of an extension of the Hartman-Grobman theorem to nonhyperbolic but asymptotically stable equilibria of vector fields. Moreover, the linearizing topological conjugacy is (i) defined on the entire basin...
详细信息
Epilepsy is a major neurological disorder characterized by recurrent, spontaneous seizures. For patients with drug-resistant epilepsy, treatments include neurostimulation or surgical removal of the epileptogenic zone ...
详细信息
Urban air mobility (UAM) is on the verge of a fast-growing expansion as the major aircraft manufacturers are in the late-stage development of various Electric Vertical Take-Off and Landing (eVTOL) aircraft models. In ...
详细信息
Toward efficient learning of massive publications during the COVID-19 pandemic, we propose a pipeline, Knowledge Extraction for COVID-19 Publications (KEP), that aims at automatic extraction and representation of key ...
详细信息
We investigate and concentrate on new infinitesimal generators of Lie symmetries for an extended(2+1)-dimensional Calogero-Bogoyavlenskii-Schif(eCBS)equation using the commutator table which results in a system of non...
详细信息
We investigate and concentrate on new infinitesimal generators of Lie symmetries for an extended(2+1)-dimensional Calogero-Bogoyavlenskii-Schif(eCBS)equation using the commutator table which results in a system of nonlinear ordinary differential equations(ODEs)which can be manually *** two stages of Lie symmetry reductions,the eCBS equation is reduced to non-solvable nonlinear ODEs using different combinations of optimal Lie *** the integration method and the Riccati and Bernoulli equation methods,we investigate new analytical solutions to those *** substituting to the original variables generates new solutions to the eCBS *** results are simulated through three-and two-dimensional plots.
In this paper, an optimization problem in a human-robot collaboration system is addressed. In Industry 4.0, mobile robots and stationary human workers work simultaneously in the same working environment. The robots ha...
详细信息
Background: The application of classsification methods through multivariate and machine learning techniques has enormous significance in agricultural sector. It is vital to classify various types of seeds as well as i...
详细信息
Background: The application of classsification methods through multivariate and machine learning techniques has enormous significance in agricultural sector. It is vital to classify various types of seeds as well as identify the quality of seeds which has a great impact on the production of crops. There is a wide range of genetic variations in dry beans all over the world. Many studies have been conducted previously on various dataset to indentify the sorts of dry beans, however most of them focused on machine learning techniques with binary classification. Objective: The aim of this study is to investigate a reliable classifier which has the lowest noise implications and establish an algorithm for dry bean classification effectively. This paper focuses on outlier removals, oversampling with Adaptive Synthetic (ADASYN) algorithm and finding the best classifier to guarantee the highest possible accuracy. Methods: The raw dataset for this study was accessed from UCI Machine Learning Repository. The dataset contained grains having 16 features, 12 dimensions, and 4 distinct shapes. For the purpose of eliminating missing values from the dataset, interquartile range (IQR) with python programming was utilized. Eight most popular classifiers were used in this study which are Logistic Regression (LR), Naïve Bayes (NB), k-Nearest Neighbor (KNN), Decision Tree (DT), Random Forest (RF), Extreme Gradient Boosting (XGB), Support Vector Machine (SVM), and Multilayer Perception (MLP) with balanced and imbalanced classes. The authors utilized frequency tables, bar diagrams, boxplots, analysis of variance for descriptive analysis as well as data preprocessing. Results: The XGB classifier preferably outperformed than other classifiers with balanced and imbalanced distribution of dry beans within each class. It has acquired accuracy (ACC) 93.0% and 95.4% in imbalanced and balanced classes respectively. In case of balanced dataset, after application of ADASYN algorithm both KNN and RF t
This paper focuses on the optimization of overparameterized, non-convex low-rank matrix sensing (LRMS)—an essential component in contemporary statistics and machine learning. Recent years have witnessed significant b...
ISBN:
(纸本)9798331314385
This paper focuses on the optimization of overparameterized, non-convex low-rank matrix sensing (LRMS)—an essential component in contemporary statistics and machine learning. Recent years have witnessed significant breakthroughs in firstorder methods, such as gradient descent, for tackling this non-convex optimization problem. However, the presence of numerous saddle points often prolongs the time required for gradient descent to overcome these obstacles. Moreover, over-parameterization can markedly decelerate gradient descent methods, transitioning its convergence rate from linear to sub-linear. In this paper, we introduce an approximated Gauss-Newton (AGN) method for tackling the non-convex LRMS problem. Notably, AGN incurs a computational cost comparable to gradient descent per iteration but converges much faster without being slowed down by saddle points. We prove that, despite the non-convexity of the objective function, AGN achieves Q-linear convergence from random initialization to the global optimal solution. The global Q-linear convergence of AGN represents a substantial enhancement over the convergence of the existing methods for the overparameterized non-convex LRMS. The code for this paper is available at https://***/hsijiaxidian/AGN.
We consider the problem of embedding point cloud data sampled from an underlying manifold with an associated flow or velocity. Such data arises in many contexts where static snapshots of dynamic entities are measured,...
We consider the problem of embedding point cloud data sampled from an underlying manifold with an associated flow or velocity. Such data arises in many contexts where static snapshots of dynamic entities are measured, including in high-throughput biology such as single-cell transcriptomics. Existing embedding techniques either do not utilize velocity information or embed the coordinates and velocities independently, i.e., they either impose velocities on top of an existing point embedding or embed points within a prescribed vector field. Here we present FlowArtist, a neural network that embeds points while jointly learning a vector field around the points. The combination allows FlowArtist to better separate and visualize velocity-informed structures. Our results, on toy datasets and single-cell RNA velocity data, illustrate the value of utilizing coordinate and velocity information in tandem for embedding and visualizing high-dimensional data.
暂无评论