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

Probabilistic Decomposed Linear Dynamical Systems for Robust Discovery of Latent Neural Dynamics

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Chen, Yenho Mudrik, Noga Johnsen, Kyle A. Alagapan, Sankaraleengam Charles, Adam S. Rozell, Christopher J. Machine Learning Center Georgia Institute of Technology United States School of Electrical and Computer Engineering Georgia Institute of Technology United States Coulter Dept. of Biomedical Engineering Emory University Georgia Institute of Technology United States Department of Biomedical Engineering Mathematical Institute for Data Science Center for Imaging Science Kavli Neuroscience Discovery Institute Johns Hopkins University United States

Time-varying linear state-space models are powerful tools for obtaining mathematically interpretable representations of neural signals. For example, switching and decomposed models describe complex systems using latent variables that evolve according to simple locally linear dynamics. However, existing methods for latent variable estimation are not robust to dynamical noise and system nonlinearity due to noise-sensitive inference procedures and limited model formulations. This can lead to inconsistent results on signals with similar dynamics, limiting the model’s ability to provide scientific insight. In this work, we address these limitations and propose a probabilistic approach to latent variable estimation in decomposed models that improves robustness against dynamical noise. Additionally, we introduce an extended latent dynamics model to improve robustness against system nonlinearities. We evaluate our approach on several synthetic dynamical systems, including an empirically-derived brain-computer interface experiment, and demonstrate more accurate latent variable inference in nonlinear systems with diverse noise conditions. Furthermore, we apply our method to a real-world clinical neurophysiology dataset, illustrating the ability to identify interpretable and coherent structure where previous models cannot. © 2024, CC BY-SA.

关键词： State space methods

Deep Neural Quality of Service Prediction for Unmanned Aircraft System Communications

学校读者我要写书评

暂无评论

Deep Neural Quality of Service Prediction for Unmanned Aircr...

International Wireless Communications and Mobile Computing Conference, IWCMC

作者： Patrick Purucker Christian Reil Alfred Höß Björn W. Schuller Department of Electrical Engineering Media Technology and Computer Sciences University of Applied Sciences Amberg-Weiden Amberg Germany CHI MRI Technical University of Munich Germany Munich Data-Science Institute (MDSI) Germany Munich Center for Machine Learning (MCML) Germany GLAM Imperial College London UK

ISBN: (数字)9798350361261

ISBN: (纸本)9798350361278

Commercial Unmanned Aircraft Systems (UAS) have a wide range of applications, including package delivery, inspection and search and rescue missions. For the operation of Unmanned Aircraft Vehicles (UAV) Beyond Visual Line of Sight (BVLOS), reliable long-range communication is essential. The cellular network is one possible solution, but there are issues such as signal loss and frequent handovers at higher altitudes. To mitigate these issues, our work proposes the use of two cellular links from different providers prioritised according to Quality of Service (QoS) prediction. We evaluate multiple AI-based model architectures for the prediction, and find that the model consisting of Gated Recurrent Units (GRU) and convolutional layers outperforms the others. The models are trained and tested on real-world data and show a reduction in latency peaks, thereby increasing connection resilience. Moreover, the prediction pipeline is designed to be executable on the UAV side and is not limited to a specific geographical area, making it applicable to real-world scenarios. Finally, we present a pre-flight path planning algorithm that takes QoS into account when calculating the flight path in order to further improve communication. To support the research community, we publicly share the dataset used to obtain our results.

关键词： Adaptation models Heuristic algorithms Quality of service Computer architecture Predictive models Autonomous aerial vehicles Modems

Empowering LLMs with Logical Reasoning: A Comprehensive Survey

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Cheng, Fengxiang Li, Haoxuan Liu, Fenrong van Rooij, Robert Zhang, Kun Lin, Zhouchen Institute for Logic Language and Computation University of Amsterdam Netherlands Center for Data Science Peking University China Machine Learning Department MBZUAI Department of Philosophy Tsinghua University China Department of Philosophy CMU United States Institute for Artificial Intelligence Peking University China Peng Cheng Laboratory China National Key Lab of General AI School of Intelligence Science and Technology Peking University China

Large language models (LLMs) have achieved remarkable successes on various natural language tasks. However, recent studies have found that there are still significant challenges to the logical reasoning abilities of LLMs. This paper summarizes and categorizes the main challenges into two aspects: (1) Logical question answering, LLMs often fail to generate the correct answer within complex logical problem which requires sophisticated deductive, inductive or abductive reasoning given a collection of premises and constrains. (2) Logical consistency, LLMs are prone to producing responses contradicting themselves across different questions. For example, a state-of-the-art Macaw question-answering LLM answers Yes to both questions Is a magpie a bird? and Does a bird have wings? but answers No to Does a magpie have wings?. To facilitate this research direction, we comprehensively investigate the most cutting-edge methods and propose detailed taxonomies of these methods. Specifically, to accurately answer complex logic questions, previous methods can be categorized based on reliance on external solvers, prompts, pretraining, and fine-tuning. To avoid logical contradictions, we discuss concepts and solutions of various logical consistencies, including implication, negation, transitivity, factuality consistency, and their composites. In addition, we review commonly used benchmark datasets and evaluation metrics, and discuss promising research directions, such as extensions to modal logic to account for uncertainty, and efficient algorithms satisfying multiple logical consistencies simultaneously. © 2025, CC BY.

关键词： Birds

Heat flux for semilocal machine-learning potentials

学校读者我要写书评

暂无评论

Physical Review B 2023年第10期108卷 L100302-L100302页

作者： Marcel F. Langer Florian Knoop Christian Carbogno Matthias Scheffler Matthias Rupp Machine Learning Group Technische Universität Berlin 10587 Berlin Germany Berlin Institute for the Foundations of Learning and Data 10623 Berlin Germany The NOMAD Laboratory at the FHI of the Max-Planck-Gesellschaft and IRIS Adlershof of the Humboldt Universität zu Berlin 14195 Berlin Germany Theoretical Physics Division Department of Physics Chemistry and Biology (IFM) Linköping University 581 83 Linköping Sweden Department of Computer and Information Science University of Konstanz 78464 Konstanz Germany Materials Research and Technology Department Luxembourg Institute of Science and Technology Belvaux Luxembourg

The Green-Kubo (GK) method is a rigorous framework for heat transport simulations in materials. However, it requires an accurate description of the potential-energy surface and carefully converged statistics. Machine-learning potentials can achieve the accuracy of first-principles simulations while allowing to reach well beyond their simulation time and length scales at a fraction of the cost. In this Letter, we explain how to apply the GK approach to the recent class of message-passing machine-learning potentials, which iteratively consider semilocal interactions beyond the initial interaction cutoff. We derive an adapted heat flux formulation that can be implemented using automatic differentiation without compromising computational efficiency. The approach is demonstrated and validated by calculating the thermal conductivity of zirconium dioxide across temperatures.

关键词： Lattice thermal conductivity Machine learning Molecular dynamics Neural network simulations

Machine learning approach for feature interpretation and classification of genetic mutations leading to tumor and cancer 1st

学校读者我要写书评

暂无评论

Machine learning approach for feature interpretation and cla...

1st International Conference on Advances in Electrical and Computer Technologies, ICAECT 2019

作者： Sah, Ankit Kumar Mishra, Abinash Reddy, U. Srinivasulu Machine Learning and Data Analytics Lab Department of Computer Applications National Institute of Technology TiruchirappalliTamil Nadu620015 India

ISBN: (纸本)9789811555572

As the interpretation of genetic mutation is done manually, it is difficult to diagnose a large number of patients and get reports of the same in a quick time. Hence, it needs to be automated using machine learning approach. Towards the same, natural language processing (NLP) technique, viz. term frequency-inverse document frequency (TF-IDF), is used to represent documents as fixed-size depiction for interpreting the given nine classes of genetic mutations. The main aim of this study is to identify the well-suited machine learning model which will give better results in terms of multi-class log-loss. Another important aspect of this study is to interpret the features since feature interpretability is very important in healthcare domain using various machine learning algorithms. Logistic regression (LR) with class balancing was implemented by taking top 1000 words of 3-gram TF-IDF generated features that outperformed the other classifiers to give a test log-loss of 0.98. © Springer Nature Singapore Pte Ltd 2020.

关键词： Machine learning

Tackling Noisy Labels with Network Parameter Additive Decomposition

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wang, Jingyi Xia, Xiaobo Lan, Long Wu, Xinghao Yu, Jun Yang, Wenjing Han, Bo Liu, Tongliang The Department of Intelligent Data Science College of Computer Science and Technology National University of Defense Technology Changsha410073 China The Trustworthy Machine Learning Lab School of Computer Science Faculty of Engineering University of Sydney DarlingtonNSW2008 Australia The State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and Engineering Beihang University Beijing100191 China The Department of Automation University of Science and Technology of China Hefei230026 China The Department of Computer Science Hong Kong Baptist University Hong Kong

Given data with noisy labels, over-parameterized deep networks suffer overfitting mislabeled data, resulting in poor generalization. The memorization effect of deep networks shows that although the networks have the ability to memorize all noisy data, they would first memorize clean training data, and then gradually memorize mislabeled training data. A simple and effective method that exploits the memorization effect to combat noisy labels is early stopping. However, early stopping cannot distinguish the memorization of clean data and mislabeled data, resulting in the network still inevitably overfitting mislabeled data in the early training stage. In this paper, to decouple the memorization of clean data and mislabeled data, and further reduce the side effect of mislabeled data, we perform additive decomposition on network parameters. Namely, all parameters are additively decomposed into two groups, i.e. , parameters w are decomposed as w = σ + γ. Afterward, the parameters σ are considered to memorize clean data, while the parameters γ are considered to memorize mislabeled data. Benefiting from the memorization effect, the updates of the parameters σ are encouraged to fully memorize clean data in early training, and then discouraged with the increase of training epochs to reduce interference of mislabeled data. The updates of the parameters γ are the opposite. In testing, only the parameters σ are employed to enhance generalization. Extensive experiments on both simulated and real-world benchmarks confirm the superior performance of our method. The implementation is available at: https://***/wangjingyi9924/TNLPAD. Copyright © 2024, The Authors. All rights reserved.

关键词： Benchmarking

Weakly Supervised Panoptic Segmentation for Defect-Based Grading of Fresh Produce

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Knott, Manuel Odion, Divinefavour Sontakke, Sameer Karwa, Anup Defraeye, Thijs Empa Swiss Federal Laboratories for Materials Science and Technology St. Gallen Switzerland Swiss Data Science Center ETH Zurich EPFL Switzerland Institute for Machine Learning Department of Computer Science ETH Zurich Switzerland Constructor University Bremen Germany Innoterra BioScience Private Limited Mumbai India

Visual inspection for defect grading in agricultural supply chains is crucial but traditionally labor-intensive and error-prone. Automated computer vision methods typically require extensively annotated datasets, which are often unavailable in decentralized supply chains. We address this challenge by evaluating the Segment Anything Model (SAM) to generate dense panoptic segmentation masks from sparse annotations. These dense predictions are then used to train a supervised panoptic segmentation model. Focusing on banana surface defects (bruises and scars), we validate our approach using 476 field images annotated with 1440 defects. While SAM-generated masks generally align with human annotations, substantially reducing annotation effort, we explicitly identify failure cases associated with specific defect sizes and shapes. Despite these limitations, our approach offers practical estimates of defect number and relative size from panoptic masks, underscoring the potential and current boundaries of foundation models for defect quantification in low-data agricultural scenarios. GitHub: https://***/manuelknott/banana-defect-segmentation © 2024, CC BY.

关键词： Image segmentation

Customer Segmentation Using Clustering Analysis

学校读者我要写书评

暂无评论

Customer Segmentation Using Clustering Analysis

Information technology, Electronics and Intelligent Communication Systems (ICITEICS), IEEE International Conference on

作者： Moses Makuei Jiet Aahash Kamble Chetan Puri Prajyot Yesankar Prateek Verma Rajendra Rewatkar Department of Computer Science & Design Faculty of Engineering and Technology Datta Meghe Institute of Higher Education & Research (DU) Wardha Maharashtra India Department of Artificial Intelligence & Data Science Faculty of Engineering and Technology Datta Meghe Institute of Higher Education & Research (DU) Wardha Maharashtra India Department of Artificial Intelligence & Machine Learning Faculty of Engineering and Technology Datta Meghe Institute of Higher Education & Research (DU) Wardha Maharashtra India Department of Biomedical Engineering Faculty of Engineering and Technology Datta Meghe Institute of Higher Education & Research (DU) Wardha Maharashtra India

ISBN: (数字)9798350382693

ISBN: (纸本)9798350382709

This research focuses on the crucial role of the clustering technique in data mining, specifically in market forecasting and planning. The study presents a comprehensive report on utilizing the k-means clustering technique and data visualization tools to develop a real- time system for a supermarket, predicting sales across various annual cycles. An open-source dataset of a mall with n = 200 customers divided into k = 3 groups, demonstrated high accuracy in predicting day-to-day sales statistics when compared with actual results. The research highlights the effectiveness of the clustering technique in real-time sales prediction for supermarkets.

关键词： Sociology Refining Decision making data visualization Prediction algorithms Real-time systems Planning

Multi-consensus decentralized accelerated gradient descent

学校读者我要写书评

暂无评论

The Journal of Machine Learning Research

The Journal of Machine learning Research 2023年第1期24卷 14474-14523页

作者： Haishan Ye Luo Luo Ziang Zhou Tong Zhang Center for Intelligent Decision-Making and Machine Learning School of Management Xi'an Jiaotong University Xi'an China School of Data Science Fudan University Shanghai China Department of Computing The Hong Kong Polytechnic University Hong Kong China Computer Science & Mathematics The Hong Kong University of Science and Technology Hong Kong China

This paper considers the decentralized convex optimization problem, which has a wide range of applications in large-scale machine learning, sensor networks, and control theory. We propose novel algorithms that achieve optimal computation complexity and near optimal communication complexity. Our theoretical results give affirmative answers to the open problem on whether there exists an algorithm that can achieve a communication complexity (nearly) matching the lower bound depending on the global condition number instead of the local one. Furthermore, the linear convergence of our algorithms only depends on the strong convexity of global objective and it does not require the local functions to be convex. The design of our methods relies on a novel integration of well-known techniques including Nesterov's acceleration, multi-consensus and gradient-tracking. Empirical studies show the outperformance of our methods for machine learning applications.

关键词： consensus optimization decentralized algorithm accelerated gradient descent gradient tracking composite optimization