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

arXiv 2023年

作者： Min, Weiqing Zhou, Pengfei Xu, Leyi Liu, Tao Li, Tianhao Huang, Mingyu Jin, Ying Yi, Yifan Wen, Min Jiang, Shuqiang Jain, Ramesh The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China The University of Chinese Academy of Sciences Beijing100049 China University of California IrvineCA92697 United States

Global food systems confront the urgent challenge of supplying sustainable, nutritious diets in the face of escalating demands. The advent of Artificial Intelligence (AI) is bringing in a personal choice revolution, wherein AI-driven individual decisions transform food systems from dinner tables, to the farms, and back to our plates. In this context, AI algorithms refine personal dietary choices, subsequently shaping agricultural outputs, and promoting an optimized feedback loop from consumption to cultivation. Initially, we delve into AI tools and techniques spanning the food supply chain, and subsequently assess how AI subfields-encompassing machine learning, computer vision, and speech recognition-are harnessed within the AI-enabled Food System (AIFS) framework, which increasingly leverages Internet of Things, multimodal sensors and real-time data exchange. We spotlight the AIFS framework, emphasizing its fusion of AI with technologies such as digitalization, big data analytics, biotechnology, and IoT extensively used in modern food systems in every component. This paradigm shifts the conventional "farm to fork" narrative to a cyclical "consumer-driven farm to fork" model for better achieving sustainable, nutritious diets. This paper explores AI's promise and the intrinsic challenges it poses within the food domain. By championing stringent AI governance, uniform data architectures, and cross-disciplinary partnerships, we argue that AI, when synergized with consumer-centric strategies, holds the potential to steer food systems toward a sustainable trajectory. We furnish a comprehensive survey for the state-of-the-art in diverse facets of food systems, subsequently pinpointing gaps and advocating for the judicious and efficacious deployment of emergent AI methodologies. Copyright © 2023, The Authors. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Efficient Robust Principal Component Analysis via Block Krylov Iteration and CUR Decomposition

Efficient Robust Principal Component Analysis via Block Kryl...

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Shun Fang Zhengqin Xu Shiqian Wu Shoulie Xie School of Information Science and Engineering Wuhan University of Science and Technology China Institute of Robotics and Intelligent Systems Wuhan University of Science and Technology China MoE Key Lab of Artificial Intelligence AI Institute Shanghai Jiao Tong University China Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial Systems Signal Processing RF & Optical Dept. Institute for Infocomm Research A*STAR Singapore

Robust principal component analysis (RPCA) is widely studied in computer vision. Recently an adaptive rank estimate based RPCA has achieved top performance in low-level vision tasks without the prior rank, but both the rank estimate and RPCA optimization algorithm involve singular value decomposition, which requires extremely huge computational resource for large-scale matrices. To address these issues, an efficient RPCA (eRPCA) algorithm is proposed based on block Krylov iteration and CUR decomposition in this paper. Specifically, the Krylov iteration method is employed to approximate the eigenvalue decomposition in the rank estimation, which requires $O(ndrq+n(rq)^{2})$ for an $(n\times d)$ input matrix, in which $q$ is a parameter with a small value, $r$ is the target rank. Based on the estimated rank, CUR decomposition is adopted to replace SVD in updating low-rank matrix component, whose complexity reduces from $O(rnd)$ to $O(r^{2}n)$ per iteration. Experimental results verify the efficiency and effectiveness of the proposed eRPCA over the state-of-the-art methods in various low-level vision applications.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Downstream-Pretext Domain Knowledge Traceback for Active Learning

arXiv

引用

arXiv 2024年

作者： Zhang, Beichen Li, Liang Zha, Zheng-Jun Luo, Jiebo Huang, Qingming The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing101408 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China The School of Information Science and Technology University of Science and Technology of China Hefei230027 China The Department of Computer Science University of Rochester RochesterNY14627 United States

Active learning (AL) is designed to construct a high-quality labeled dataset by iteratively selecting the most informative samples. Such sampling heavily relies on data representation, while recently pre-training is popular for robust feature learning. However, as pre-training utilizes low-level pretext tasks that lack annotation, directly using pre-trained representation in AL is inadequate for determining the sampling score. To address this problem, we propose a downstream-pretext domain knowledge traceback (DOKT) method that traces the data interactions of downstream knowledge and pre-training guidance for selecting diverse and instructive samples near the decision boundary. DOKT consists of a traceback diversity indicator and a domain-based uncertainty estimator. The diversity indicator constructs two feature spaces based on the pre-training pretext model and the downstream knowledge from annotation, by which it locates the neighbors of unlabeled data from the downstream space in the pretext space to explore the interaction of samples. With this mechanism, DOKT unifies the data relations of low-level and high-level representations to estimate traceback diversity. Next, in the uncertainty estimator, domain mixing is designed to enforce perceptual perturbing to unlabeled samples with similar visual patches in the pretext space. Then the divergence of perturbed samples is measured to estimate the domain uncertainty. As a result, DOKT selects the most diverse and important samples based on these two modules. The experiments conducted on ten datasets show that our model outperforms other state-of-the-art methods and generalizes well to various application scenarios such as semantic segmentation and image captioning. Copyright © 2024, The Authors. All rights reserved.

关键词： Domain Knowledge

来源：评论

学校读者我要写书评

暂无评论

Toward a Unified Framework for Unsupervised Complex Tabular Reasoning

Toward a Unified Framework for Unsupervised Complex Tabular ...

引用

International Conference on Data Engineering

作者： Zhenyu Li Xiuxing Li Zhichao Duan Bowen Dong Ning Liu Jianyong Wang Department of Computer Science and Technology Tsinghua University Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences (ICT/CAS) University of Chinese Academy of Sciences School of Software Shandong University Jinan China

Structured tabular data exist across nearly all fields. Reasoning task over these data aims to answer questions or determine the truthiness of hypothesis sentences by understanding the semantic meaning of a table. While previous works have devoted significant efforts to the tabular reasoning task, they always assume there are sufficient labeled data. However, constructing reasoning samples over tables (and related text) is labor-intensive, especially when the reasoning process is complex. When labeled data is insufficient, the performance of models will suffer an unendurable decline. In this paper, we propose a unified framework for unsupervised complex tabular reasoning (UCTR), which generates sufficient and diverse synthetic data with complex logic for tabular reasoning tasks, assuming no human-annotated data at all. Specifically, we first utilize a random sampling strategy to collect diverse programs of different types and execute them on tables based on a "Program-Executor" module. To bridge the gap between the programs and natural language sentences, we design a powerful "NL-Generator" module to generate natural language sentences with complex logic from these programs. Since a table often occurs with its surrounding texts, we further propose novel "Table-to-Text" and "Text-to-Table" operators to handle joint table-text reasoning scenarios. This way, we can adequately exploit the unlabeled table resources to obtain a well-performed reasoning model under an unsupervised setting. Our experiments cover different tasks (question answering and fact verification) and different domains (general and specific), showing that our unsupervised methods can achieve at most 93% performance compared to supervised models. The impressive performance demonstrates that UCTR can significantly reduce the dependence on manual annotation. Moreover, we also find that it can substantially boost the supervised performance in low-resourced domains as a data augmentation technique.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Automatic Construction of Classification Dimensions on Texts

SSRN

引用

SSRN 2022年

作者： Ma, Bing Zhuge, Hai The Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China The Great Bay University Dongguan China

A way to efficiently manage large sets of texts is to construct multiple dimensions on texts and manage the texts from different dimensions. An approach to automatically constructing classification dimensions is to generate class trees on texts and a label for each class so that texts can be efficiently managed based on the generated trees and labels. The key issue is to classify texts into classes according to common semantics defined by a representation model of text. The vector space model represents texts in a space of high dimensions as it regards word as dimension. The classification methods based on the vector space is to classify texts according to the calculation of the distance between vectors of texts. However, the characteristics of the distances like the triangle inequality of distances is unsuitable to restrict the semantic relations between texts and measure the similarity of a set of more than two texts. The frequently occurred common words within a set of texts is a way to represent the texts but the traditional frequent-term-set based text clustering approaches generate a wide range of frequent term sets from one word to a maximum set of words satisfying the pre-determined minimum support degree, the initial classes it generates are not in line with the original classes, and it often generates the meaningless initial classes according to frequent-term sets. Topic model is not suitable for generating class trees on texts as topics are represented by probability distribution on all words. This paper proposes an approach to use common words of texts to represent the texts and calculates the similarity of a class of texts by calculating the sum of the weights of common words of the class where the common words of a class of texts represent the common semantics of these texts and the idea is in line with human classification of texts. Based on the common words representation, a bottom-up text clustering approach is proposed to construct class trees of t

关键词： information management

来源：评论

学校读者我要写书评

暂无评论

DRAUC: an instance-wise distributionally robust AUC optimization framework 23

DRAUC: an instance-wise distributionally robust AUC optimiza...

引用

Proceedings of the 37th International Conference on Neural information processing Systems

作者： Siran Dai Qianqian Xu Zhiyong Yang Xiaochun Cao Qingming Huang SKLOIS Institute of Information Engineering CAS and School of Cyber Security University of Chinese Academy of Sciences Key Lab. of Intelligent Information Processing Institute of Computing Tech. CAS School of Computer Science and Tech. University of Chinese Academy of Sciences School of Cyber Science and Tech. Shenzhen Campus of Sun Yat-sen University School of Computer Science and Tech. University of Chinese Academy of Sciences and Key Lab. of Intelligent Information Processing Institute of Computing Tech. CAS and BDKM University of Chinese Academy of Sciences

The Area Under the ROC Curve (AUC) is a widely employed metric in long-tailed classification scenarios. Nevertheless, most existing methods primarily assume that training and testing examples are drawn i.i.d. from the same distribution, which is often unachievable in practice. Distributionally Robust Optimization (DRO) enhances model performance by optimizing it for the local worst-case scenario, but directly integrating AUC optimization with DRO results in an intractable optimization problem. To tackle this challenge, methodically we propose an instance-wise surrogate loss of Distributionally Robust AUC (DRAUC) and build our optimization framework on top of it. Moreover, we highlight that conventional DRAUC may induce label bias, hence introducing distribution-aware DRAUC as a more suitable metric for robust AUC learning. Theoretically, we affirm that the generalization gap between the training loss and testing error diminishes if the training set is sufficiently large. Empirically, experiments on corrupted benchmark datasets demonstrate the effectiveness of our proposed method. Code is available at: https://***/EldercatSAM/DRAUC.

关键词：

来源：评论

学校读者我要写书评

暂无评论

HairDiffusion: vivid multi-colored hair editing via latent diffusion 24

HairDiffusion: vivid multi-colored hair editing via latent d...

引用

Proceedings of the 38th International Conference on Neural information processing Systems

作者： Yu Zeng Yang Zhang Jiachen Liu Linlin Shen Kaijun Deng Weizhao He Jinbao Wang Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University and Shenzhen Institute of Artificial Intelligence and Robotics for Society and National Engineering Laboratory for Big Data System Computing Technology Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen University and Guangdong Provincial Key Laboratory of Intelligent Information Processing

ISBN: (纸本)9798331314385

Hair editing is a critical image synthesis task that aims to edit hair color and hairstyle using text descriptions or reference images, while preserving irrelevant attributes (e.g., identity, background, cloth). Many existing methods are based on StyleGAN to address this task. However, due to the limited spatial distribution of StyleGAN, it struggles with multiple hair color editing and facial preservation. Considering the advancements in diffusion models, we utilize Latent Diffusion Models (LDMs) for hairstyle editing. Our approach introduces Multi-stage Hairstyle Blend (MHB), effectively separating control of hair color and hairstyle in diffusion latent space. Additionally, we train a warping module to align the hair color with the target region. To further enhance multi-color hairstyle editing, we fine-tuned a CLIP model using a multi-color hairstyle dataset. Our method not only tackles the complexity of multi-color hairstyles but also addresses the challenge of preserving original colors during diffusion editing. Extensive experiments showcase the superiority of our method in editing multi-color hairstyles while preserving facial attributes given textual descriptions and reference images.

关键词：

来源：评论

学校读者我要写书评

暂无评论

HairDiffusion: Vivid Multi-Colored Hair Editing via Latent Diffusion

arXiv

引用

arXiv 2024年

作者： Zeng, Yu Zhang, Yang Liu, Jiachen Shen, Linlin Deng, Kaijun He, Weizhao Wang, Jinbao Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University China Shenzhen Institute of Artificial Intelligence and Robotics for Society China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China

关键词： Color image processing

来源：评论

学校读者我要写书评

暂无评论

A unified generalization analysis of re-weighting and logit-adjustment for imbalanced learning 23

A unified generalization analysis of re-weighting and logit-...

引用

Proceedings of the 37th International Conference on Neural information processing Systems

作者： Zitai Wang Qianqian Xu Zhiyong Yang Yuan He Xiaochun Cao Qingming Huang SKLOIS Institute of Information Engineering CAS and School of Cyber Security University of Chinese Academy of Sciences Key Lab. of Intelligent Information Processing Institute of Computing Tech. CAS School of Computer Science and Tech. University of Chinese Academy of Sciences Alibaba Group School of Cyber Science and Tech. Shenzhen Campus of Sun Yat-sen University School of Computer Science and Tech. University of Chinese Academy of Sciences and Key Lab. of Intelligent Information Processing Institute of Computing Tech. CAS and BDKM University of Chinese Academy of Sciences

Real-world datasets are typically imbalanced in the sense that only a few classes have numerous samples, while many classes are associated with only a few samples. As a result, a naïve ERM learning process will be biased towards the majority classes, making it difficult to generalize to the minority classes. To address this issue, one simple but effective approach is to modify the loss function to emphasize the learning on minority classes, such as re-weighting the losses or adjusting the logits via class-dependent terms. However, existing generalization analysis of such losses is still coarse-grained and fragmented, failing to explain some empirical results. To bridge this gap, we propose a novel technique named data-dependent contraction to capture how these modified losses handle different classes. On top of this technique, a fine-grained generalization bound is established for imbalanced learning, which helps reveal the mystery of re-weighting and logit-adjustment in a unified manner. Furthermore, a principled learning algorithm is developed based on the theoretical insights. Finally, the empirical results on benchmark datasets not only validate the theoretical results but also demonstrate the effectiveness of the proposed method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Dual-State Personalized Knowledge Tracing with Emotional Incorporation

arXiv

引用

arXiv 2024年

作者： Wang, Shanshan Yuan, Fangzheng Wang, keyang Yang, Xun Zhang, Xingyi Wang, Meng Information Materials and Intelligent Sensing Laboratory of Anhui Province Institute of Physical Science and Information Technology Anhui University Hefei230601 China Zhejiang Dahua Technology Co. Ltd China Department of Electronic Engineering and Information Science School of information Science and Technology University of Science and Technology of China Hefei230026 China Key Laboratory of intelligent computing and Signal Processing Ministry of Education school of Computer Science and Technology Anhui University Hefei230601 China School of Computer Science and Information Engineering Hefei University of Technology Hefei230009 China

Knowledge tracing has been widely used in online learning systems to guide the students' future learning. However, most existing KT models primarily focus on extracting abundant information from the question sets and explore the relationships between them, but ignore the personalized student behavioral information in the learning process. This will limit the model's ability to accurately capture the personalized knowledge states of students and reasonably predict their performances. To alleviate this limitation, we explicitly models the personalized learning process by incorporating the emotions, a representative personalized behavior in the learning process, into KT framework. Specifically, we present a novel Dual-State Personalized Knowledge Tracing with Emotional Incorporation model to achieve this goal: Firstly, we incorporate emotional information into the modeling process of knowledge state, resulting in the Knowledge State Boosting Module. Secondly, we design an Emotional State Tracing Module to monitor students' personalized emotional states, and propose an emotion prediction method based on personalized emotional states. Finally, we apply the predicted emotions to enhance students' response prediction. Furthermore, to extend the generalization capability of our model across different datasets, we design a transferred version of DEKT, named Transfer Learningbased Self-loop model (T-DEKT). Extensive experiments show our method achieves the state-of-the-art performance. Copyright © 2024, The Authors. All rights reserved.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：