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

arXiv 2025年

作者： Dai, Gordon Ravishankar, Pavan Yuan, Rachel Neill, Daniel B. Black, Emily Machine Learning for Good Laboratory Department of Computer Science NYU Courant Institute of Mathematical Sciences New York University United States Robert F. Wagner Graduate School of Public Service New York University United States Center for Urban Science and Progress Tandon School of Engineering New York University United States Center for Data Science New York University United States Department of Computer Science and Engineering Tandon School of Engineering New York University United States

When selecting a model from a set of equally performant models, how much unfairness can you really reduce? Is it important to be intentional about fairness when choosing among this set, or is arbitrarily choosing among the set of "good" models good enough? Recent work has highlighted that the phenomenon of model multiplicity—where multiple models with nearly identical predictive accuracy exist for the same task—has both positive and negative implications for fairness, from strengthening the enforcement of civil rights law in AI systems to showcasing arbitrariness in AI decision-making. Despite the enormous implications of model multiplicity, there is little work that explores the properties of sets of equally accurate models, or Rashomon sets, in general. In this paper, we present five main theoretical and methodological contributions which help us to understand the relatively unexplored properties of the Rashomon set, in particular with regards to fairness. Our contributions include methods for efficiently sampling models from this set and techniques for identifying the fairest models according to key fairness metrics such as statistical parity. We also derive the probability that an individual’s prediction will be flipped within the Rashomon set, as well as expressions for the set’s size and the distribution of error tolerance used across models. These results lead to policy-relevant takeaways, such as the importance of intentionally looking for fair models within the Rashomon set, and understanding which individuals or groups may be more susceptible to arbitrary decisions. © 2025, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

S3Attention: Improving Long Sequence Attention with Smoothed Skeleton Sketching

arXiv

引用

arXiv 2024年

作者： Wang, Xue Zhou, Tian Zhu, Jianqing Liu, Jialin Yuan, Kun Yao, Tao Yin, Wotao Jin, Rong Cai, Han Qin Alibaba Group BellevueWA98004 United States Computer Electrical and Mathematical Science and Engineering Division King Abdullah University of Science and Technology Thuwal23955 Saudi Arabia Department of Statistics and Data Science University of Central Florida OrlandoFL32816 United States Center for Machine Learning Research Peking University Beijing100871 China Antai College of Economics and Management Shanghai Jiao Tong University Shanghai200030 China Meta Menlo ParkCA94025 United States Department of Statistics and Data Science Department of Computer Science University of Central Florida OrlandoFL32816 United States

Attention based models have achieved many remarkable breakthroughs in numerous applications. However, the quadratic complexity of Attention makes the vanilla Attention based models hard to apply to long sequence tasks. Various improved Attention structures are proposed to reduce the computation cost by inducing low rankness and approximating the whole sequence by sub-sequences. The most challenging part of those approaches is maintaining the proper balance between information preservation and computation reduction: the longer sub-sequences used, the better information is preserved, but at the price of introducing more noise and computational costs. In this paper, we propose a smoothed skeleton sketching based Attention structure, coined S3Attention, which significantly improves upon the previous attempts to negotiate this trade-off. S3Attention has two mechanisms to effectively minimize the impact of noise while keeping the linear complexity to the sequence length: a smoothing block to mix information over long sequences and a matrix sketching method that simultaneously selects columns and rows from the input matrix. We verify the effectiveness of S3Attention both theoretically and empirically. Extensive studies over Long Range Arena (LRA) datasets and six time-series forecasting show that S3Attention significantly outperforms both vanilla Attention and other state-of-the-art variants of Attention structures. Copyright © 2024, The Authors. All rights reserved.

关键词： Musculoskeletal system

来源：评论

学校读者我要写书评

暂无评论

Facial Expression Recognition Using Multi-Block Deep CNN

Facial Expression Recognition Using Multi-Block Deep CNN

引用

International Conference on Circuits, Communication, Control and Computing

作者： Priyadarshini V Srinivasulu Reddy U Venkata Rami Reddy Chirra Mrudula M Suneetha M Dept. of Computer Science & Engineering National Institute of Technology Andhra Pradesh India Dept. of Computer Applications Machine Learning & Data Analytics lab National Institute of Technology Tiruchirappalli India School of Computer Science & Engineering VIT-AP University Amaravathi India Department of CSE Malla Reddy College of Engineering Telangana India Independent Researcher Amaravati India

ISBN: (数字)9798331528539

ISBN: (纸本)9798331528546

Emotions play a crucial role in decision-making, moral judgments, and other cognitive processes. The goal of this work is to identify people's facial emotions from face images. Facial expression recognition (FER), a highly diverse field with many commonalities between classes, is a challenging problem. The capabilities of current FER systems are limited in this regard. In this work, a multi-block Deep Convolutional Neural Networks (DCNN) model was proposed to identify facial expressions. Five blocks with different computational components were defined in a multi-block DCNN to extract the unique characteristics from input images. The second model (DCNN-SVM) is developed with an ensemble of SVM classifier to improve predictability and stability. The third model (DCNN-MV) is based on the majority voting with 4 classifiers SVM, KNN, Random Forest, and Decision Tree. The CK+ dataset was utilized and expanded via image data augmentation to enhance model performance and generalization. By adjusting hyperparameters, the suggested DCNN model's accuracy was investigated. The DCNN model reports an accuracy score of 97.71%. Both DCNN-SVM and DCNN-MV models achieved 97.79% accuracy. On the CK+ dataset, the proposed models demonstrated good accuracy in identifying facial expressions. When compared to existing models, the proposed model outperformed existing models in terms of accuracy.

关键词： Support vector machines Accuracy Computational modeling Face recognition Stability analysis Circuit stability Convolutional neural networks Integrated circuit modeling Thermal stability Random forests

来源：评论

学校读者我要写书评

暂无评论

Adaptive atomic basis sets

arXiv

引用

arXiv 2024年

作者： Khan, Danish Ach, Maximillian L. von Lilienfeld, O. Anatole Chemical Physics Theory Group Department of Chemistry University of Toronto St. George Campus TorontoON Canada Vector Institute for Artificial Intelligence TorontoONM5S 1M1 Canada Department of Physics University of Toronto St. George Campus TorontoON Canada Munich Germany Acceleration Consortium University of Toronto TorontoON Canada Department of Materials Science and Engineering University of Toronto St. George Campus TorontoON Canada Machine Learning Group Technische Universität Berlin Institute for the Foundations of Learning and Data Berlin10587 Germany Berlin Institute for the Foundations of Learning and Data Berlin10587 Germany

Atomic basis sets are widely employed within quantum mechanics based simulations of matter. We introduce a machine learning model that adapts the basis set to the local chemical environment of each atom, prior to the start of self consistent field (SCF) calculations. In particular, as a proof of principle and because of their historic popularity, we have studied the Gaussian type orbitals from the Pople basis set, i.e. the STO-3G, 3-21G, 6-31G and 6-31G*. We adapt the basis by scaling the variance of the radial Gaussian functions leading to contraction or expansion of the atomic orbitals. A data set of optimal scaling factors for C, H, O, N and F were obtained by variational minimization of the Hartree-Fock (HF) energy of the smallest 2500 organic molecules from the QM9 database. Kernel ridge regression based machine learning (ML) prediction errors of the change in scaling decay rapidly with training set size, typically reaching less than 1% for training set size 2000. Overall, we find systematically lower variance, and consequently the larger training efficiencies, when going from hydrogen to carbon to nitrogen to oxygen. Using the scaled basis functions obtained from the ML model, we conducted HF calculations for the subsequent 30’000 molecules in QM9. In comparison to the corresponding default Pople basis set results we observed improved energetics in up to 99% of all cases. With respect to the larger basis set 6-311G(2df,2pd), atomization energy errors are lowered on average by ∼31, 107, 11, and 11 kcal/mol for STO-3G, 3-21G, 6-31G and 6-31G*, respectively — with negligible computational overhead. We illustrate the high transferability of adaptive basis sets for larger out-of-domain molecules relevant to addiction, diabetes, pain, aging. Generally, deviation from cc-pvQZ based HF results for counter-poise corrected atomization energies, HOMO-LUMO gaps, and dipole moments also decreases — in line with the variational principle. © 2024, CC BY.

关键词： Quantum theory

来源：评论

学校读者我要写书评

暂无评论

GAIA: A Global, Multi-modal, Multi-scale Vision-Language dataset for Remote Sensing Image Analysis

arXiv

引用

arXiv 2025年

作者： Zavras, Angelos Michail, Dimitrios Zhu, Xiao Xiang Demir, Begüm Papoutsis, Ioannis Orion Lab School of Rural Surveying and Geoinformatics Engineering National Technical University of Athens Athens15772 Greece Institute of Astronomy Astrophysics Space Applications and Remote Sensing National Observatory of Athens Athens11810 Greece Department of Informatics and Telematics Harokopio University of Athens Athens17676 Greece Chair of Data Science in Earth Observation Technical University of Munich Munich80333 Germany Munich Center for Machine Learning Munich80333 Germany Faculty of Electrical Engineering and Computer Science Technische Universität Berlin Berlin10623 Germany BIFOLD - Berlin Institute for the Foundations of Learning and Data Berlin10623 Germany

The continuous operation of Earth-orbiting satellites generates vast and ever-growing archives of Remote Sensing (RS) images. Natural language presents an intuitive interface for accessing, querying, and interpreting the data from such archives. However, existing Vision-Language Models (VLMs) are predominantly trained on web-scraped, noisy image-text data, exhibiting limited exposure to the specialized domain of RS. This deficiency results in poor performance on RS-specific tasks, as commonly used datasets often lack detailed, scientifically accurate textual descriptions and instead emphasize solely on attributes like date and location. To bridge this critical gap, we introduce GAIA, a novel dataset designed for multi-scale, multi-sensor, and multi-modal RS image analysis. GAIA comprises of 205,150 meticulously curated RS image-text pairs, representing a diverse range of RS modalities associated to different spatial resolutions. Unlike existing vision-language datasets in RS, GAIA specifically focuses on capturing a diverse range of RS applications, providing unique information about environmental changes, natural disasters, and various other dynamic phenomena. The dataset provides a spatially and temporally balanced distribution, spanning across the globe, covering the last 25 years with a balanced temporal distribution of observations. GAIA’s construction involved a two-stage process: (1) targeted web-scraping of images and accompanying text from reputable RS-related sources, and (2) generation of five high-quality, scientifically grounded synthetic captions for each image using carefully crafted prompts that leverage the advanced vision-language capabilities of GPT-4o. We also release an automated processing framework developed for this purpose, enabling the broader research community to generate captions for RS images using the web-crawled image-text data. Our extensive experiments, including fine-tuning of CLIP and BLIP2 models, demonstrate that GAIA significan

关键词： Visual languages

来源：评论

学校读者我要写书评

暂无评论

MambaLRP: Explaining Selective State Space Sequence Models

arXiv

引用

arXiv 2024年

作者： Jafari, Farnoush Rezaei Montavon, Grégoire Müller, Klaus-Robert Eberle, Oliver Machine Learning Group Technische Universität Berlin Berlin10587 Germany BIFOLD Berlin Institute for the Foundations of Learning and Data Berlin10587 Germany Department of Mathematics and Computer Science Freie Universität Berlin Arnimallee 14 Berlin14195 Germany Department of Artificial Intelligence Korea University Seoul136-713 Korea Republic of Max Planck Institute for Informatics Stuhlsatzenhausweg 4 Saarbrücken66123 Germany Google DeepMind Berlin Germany

Recent sequence modeling approaches using selective state space sequence models, referred to as Mamba models, have seen a surge of interest. These models allow efficient processing of long sequences in linear time and are rapidly being adopted in a wide range of applications such as language modeling, demonstrating promising performance. To foster their reliable use in real-world scenarios, it is crucial to augment their transparency. Our work bridges this critical gap by bringing explainability, particularly Layer-wise Relevance Propagation (LRP), to the Mamba architecture. Guided by the axiom of relevance conservation, we identify specific components in the Mamba architecture, which cause unfaithful explanations. To remedy this issue, we propose MambaLRP, a novel algorithm within the LRP framework, which ensures a more stable and reliable relevance propagation through these components. Our proposed method is theoretically sound and excels in achieving state-of-the-art explanation performance across a diverse range of models and datasets. Moreover, MambaLRP facilitates a deeper inspection of Mamba architectures, uncovering various biases and evaluating their significance. It also enables the analysis of previous speculations regarding the long-range capabilities of Mamba models. Copyright © 2024, The Authors. All rights reserved.

关键词： Modeling languages

来源：评论

学校读者我要写书评

暂无评论

Martingale Methods for Sequential Estimation of Convex Functionals and Divergences

arXiv

引用

arXiv 2021年

作者： Manole, Tudor Ramdas, Aaditya Department of Statistics and Data Science Carnegie Mellon University United States Machine Learning Department Carnegie Mellon University United States

We present a unified technique for sequential estimation of convex divergences between distributions, including integral probability metrics like the kernel maximum mean discrepancy, -divergences like the Kullback-Leibler divergence, and optimal transport costs, such as powers of Wasserstein distances. This is achieved by observing that empirical convex divergences are (partially ordered) reverse submartingales with respect to the exchangeable filtration, coupled with maximal inequalities for such processes. These techniques appear to be complementary and powerful additions to the existing literature on both confidence sequences and convex divergences. We construct an offline-to-sequential device that converts a wide array of existing offline concentration inequalities into time-uniform confidence sequences that can be continuously monitored, providing valid tests or confidence intervals at arbitrary stopping times. The resulting sequential bounds pay only an iterated logarithmic price over the corresponding fixed-time bounds, retaining the same dependence on problem parameters (like dimension or alphabet size if applicable). These results are also applicable to more general convex functionals—like the negative differential entropy, suprema of empirical processes, and V-Statistics—and to more general processes satisfying a key leave-one-out property. Copyright © 2021, The Authors. All rights reserved.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

Tracking the risk of a deployed model and detecting harmful distribution shifts

arXiv

引用

arXiv 2021年

作者： Podkopaev, Aleksandr Ramdas, Aaditya Department of Statistics & Data Science Carnegie Mellon University United States Machine Learning Department Carnegie Mellon University United States

When deployed in the real world, machine learning models inevitably encounter changes in the data distribution, and certain—but not all—distribution shifts could result in significant performance degradation. In practice, it may make sense to ignore benign shifts, under which the performance of a deployed model does not degrade substantially, making interventions by a human expert (or model retraining) unnecessary. While several works have developed tests for distribution shifts, these typically either use non-sequential methods, or detect arbitrary shifts (benign or harmful), or both. We argue that a sensible method for firing off a warning has to both (a) detect harmful shifts while ignoring benign ones, and (b) allow continuous monitoring of model performance without increasing the false alarm rate. In this work, we design simple sequential tools for testing if the difference between source (training) and target (test) distributions leads to a significant increase in a risk function of interest, like accuracy or calibration. Recent advances in constructing time-uniform confidence sequences allow efficient aggregation of statistical evidence accumulated during the tracking process. The designed framework is applicable in settings where (some) true labels are revealed after the prediction is performed, or when batches of labels become available in a delayed fashion. We demonstrate the efficacy of the proposed framework through an extensive empirical study on a collection of simulated and real datasets. Copyright © 2021, The Authors. All rights reserved.

关键词： machine learning

来源：评论

学校读者我要写书评

暂无评论

A Review on Advancing Prosthetics with Artificial Intelligence: Enhancing Control, Sensory Feedback, and Adaptability

A Review on Advancing Prosthetics with Artificial Intelligen...

引用

International Conference on Trends in Electronics and Informatics (ICEI)

作者： Shivam Bhoyar Renuka Motghare Subodh Daronde Department of Artificial Intillengence and Data Science Datta Meghe Institute of Higher Education and Research(Demeed to be University) Wardha Maharashtra India Department of Artificial Intillengence and Machine Learning Datta Meghe Institute of Higher Education and Research (Demeed to be University) Wardha Maharashtra India Department of Biomedical Engineering Faculty of Engineering and Technology Datta Meghe Institute of Higher Education and Research. (Demeed to be University) Wardha Maharashtra India

ISBN: (数字)9798331544607

ISBN: (纸本)9798331544614

Recent advancements in prosthetic technology have dramatically improved quality of life for amputees, with AI-powered devices now offering capabilities far beyond traditional prosthetics. This paper traces the evolution of prosthetic limbs from basic mechanical designs to today's intelligent systems featuring myoelectric control and neural interfaces. Modern AI integration enables three key benefits: (1) more natural movement through real-time pattern recognition, (2) enhanced sensory feedback that restores touch perception, and (3) adaptive functionality that reduces user fatigue. Breakthroughs in osseointegration and smart materials further improve comfort and usability. These innovations extend beyond limb prosthetics to include cardiac implants and spinal support systems. Looking ahead, we anticipate a new generation of affordable, autonomous prosthetics that will blur the line between human and machine capabilities.

关键词： Limbs Technological innovation Prosthetic limbs Reviews Tactile sensors Surgery Real-time systems Usability Smart materials Prosthetics

来源：评论

学校读者我要写书评

暂无评论

Nonparametric Two-Sample Testing by Betting

arXiv

引用

arXiv 2021年

作者： Shekhar, Shubhanshu Ramdas, Aaditya Department of Statistics and Data Science Carnegie Mellon University United States Machine Learning Department Carnegie Mellon University United States

We study the problem of designing consistent sequential two-sample tests in a nonparametric setting. Guided by the principle of testing by betting, we reframe this task into that of selecting a sequence of payoff functions that maximize the wealth of a fictitious bettor, betting against the null in a repeated game. In this setting, the relative increase in the bettor’s wealth has a precise interpretation as the measure of evidence against the null, and thus our sequential test rejects the null when the wealth crosses an appropriate threshold. We develop a general framework for setting up the betting game for two-sample testing, in which the payoffs are selected by a prediction strategy as data-driven predictable estimates of the witness function associated with the variational representation of some statistical distance measures, such as integral probability metrics (IPMs). We then formally relate the statistical properties of the test (such as consistency, type-II error exponent and expected sample size) to the regret of the corresponding prediction strategy. We construct a practical sequential two-sample test by instantiating our general strategy with the kernel-MMD metric, and demonstrate its ability to adapt to the difficulty of the unknown alternative through theoretical and empirical results. Our framework is versatile, and easily extends to other problems;we illustrate this by applying our approach to construct consistent tests for the following problems: (i) time-varying two-sample testing with non-exchangeable observations, and (ii) an abstract class of "invariant" testing problems, including symmetry and independence testing. © 2021, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：