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

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Li, Xiyuan Wang, Youjun Liu, Weiwei School of Computer Science Wuhan University National Engineering Research Center for Multimedia Software Wuhan University Institute of Artificial Intelligence Wuhan University Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan University

Sparse ridge regression problems play a significant role across various domains. To solve sparse ridge regression, [1] recently proposes an advanced algorithm, Scalable Optimal K-Sparse Ridge Regression (OKRidge), which is both faster and more accurate than existing approaches. However, the absence of theoretical analysis on the error of OKRidge impedes its large-scale applications. In this paper, we reframe the estimation error of OKRidge as a Primary Optimization (PO) problem and employ the Convex Gaussian min-max theorem (CGMT) to simplify the PO problem into an Auxiliary Optimization (AO) problem. Subsequently, we provide a theoretical error analysis for OKRidge based on the AO problem. This error analysis improves the theoretical reliability of OKRidge. We also conduct experiments to verify our theorems and the results are in excellent agreement with our theoretical findings. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Boosting-Type Convergence Result for *** with Factorized Multi-Class Classifiers 38

A Boosting-Type Convergence Result for *** with Factorized M...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Zou, Xin Zhou, Zhengyu Xu, Jingyuan Liu, Weiwei School of Computer Science Wuhan University National Engineering Research Center for Multimedia Software Wuhan University Institute of Artificial Intelligence Wuhan University Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan University

ADABOOST is a well-known algorithm in boosting. Schapire and Singer propose, an extension of ADABOOST, named ***, for multi-class classification problems. Kégl shows empirically that *** works better when the classical one-against-all base classifiers are replaced by factorized base classifiers containing a binary classifier and a vote (or code) vector. However, the factorization makes it much more difficult to provide a convergence result for the factorized version of ***. Then, Kégl raises an open problem in COLT 2014 to look for a convergence result for the factorized ***. In this work, we resolve this open problem by presenting a convergence result for *** with factorized multi-class classifiers. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Improving Acoustic Echo Cancellation by Mixing Speech Local and Global Features with Transformer 48

Improving Acoustic Echo Cancellation by Mixing Speech Local ...

引用

48th IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2023

作者： Liu, Yajie Xu, Xinmeng Tu, Weiping Yang, Yuhong Xiao, Li Wuhan University National Engineering Research Center for Multimedia Software School of Computer Science China Wuhan University Hubei Key Laboratory of Multimedia and Network Communication Engineering China

ISBN: (纸本)9781728163277

We propose MiT-Net, a novel mix-transformer neural network with a pyramid encoder operating in the time domain, for the task of acoustic echo cancellation. The MiT-Net formulates acoustic echo cancellation as a supervised speech separation problem, in which near-end speech is separated from a single microphone recording and sent to the far end, and consists of two key components. First, we apply a pyramid encoder, which adopts the coarse-to-fine structure, to extract the latent correlations between double-end signals and to fuse them in a multiscale manner. Second, we propose a mix-transformer, a combination of local and global attention in a parallel way, to leverage local and global speech information for separation. Experimental results show that the proposed method outperforms recent AEC methods in terms of objective evaluation metrics. In addition, exploring the correlation between speech local and global features by using the mix-transformer significantly improves the system performance and shows more robustness than the conventional transformer. © 2023 IEEE.

关键词： Signal encoding

来源：评论

学校读者我要写书评

暂无评论

Learning from Imperfect Data: Towards Efficient Knowledge Distillation of Autoregressive Language Models for Text-to-SQL

Learning from Imperfect Data: Towards Efficient Knowledge Di...

引用

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Zhong, Qihuang Chen, Kunfeng Ding, Liang Liu, Juhua Du, Bo Tao, Dacheng School of Computer Science National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan University China The University of Sydney Australia Nanyang Technological University Singapore

ISBN: (纸本)9798891761681

Large Language Models (LLMs) have shown promising performance in text-to-SQL, which involves translating natural language questions into SQL queries. However, current text-to-SQL LLMs are computationally expensive and challenging to deploy in real-world applications, highlighting the importance of compressing them. To achieve this goal, knowledge distillation (KD) is a common approach, which aims to distill the larger teacher model into a smaller student model. While numerous KD methods for autoregressive LLMs have emerged recently, it is still under-explored whether they work well in complex text-to-SQL scenarios. To this end, we conduct a series of analyses and reveal that these KD methods generally fall short in balancing performance and efficiency. In response to this problem, we propose to improve the KD with Imperfect Data, namely KID, which effectively boosts the performance without introducing much training budget. The core of KID is to efficiently mitigate the training-inference mismatch by simulating the cascading effect1 of inference in the imperfect training data. Extensive experiments on 5 text-to-SQL benchmarks show that, KID can not only achieve consistent and significant performance gains (up to +5.83% average score) across all model types and sizes, but also effectively improve the training efficiency. © 2024 Association for Computational Linguistics.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

Optimal Illumination Distance Metrics for Person Re-identification 21st

Optimal Illumination Distance Metrics for Person Re-identif...

引用

21st Pacific Rim International Conference on Artificial Intelligence, PRICAI 2024

作者： Wang, Chao Wang, Zhongyuan Hu, Ruimin Wang, Xiaochen Zhou, Wen National Engineering Research Center for Multimedia Software School of Computer Science Wuhan University Wuhan China Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan University Wuhan China College of Information Engineering Nanjing University of Finance Economics Nanjing China

ISBN: (纸本)9789819601240

Person re-identification (Re-ID) has been widely used in public security and surveillance. Due to the influence of different shooting times and locations, can lead to lighting variations in the images captured by the camera, and the lighting variations seriously affect the Re-ID performance. Existing methods utilize images under different lighting conditions to transform to uniform lighting conditions to eliminate the effect of lighting on Re-ID. However, these methods ignore the fact that different illumination metric distances have different recognition performances. Therefore, we propose the optimal illumination distance metric, by analyzing different light distances for pedestrians in different light conditions, we find that there exists an optimal light condition in which the distance between image pairs is smaller than the distance in other light conditions. The distance under the optimal lighting condition is used in the retrieval process as the distance between its final sorted image pairs. To verify the effectiveness of our method, Market-1501-IA and Duke-MTMC-IA datasets are constructed, and a large number of experiments are conducted under different lighting conditions to verify the existence of the optimal lighting conditions and the effectiveness of the proposed method. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Lighting

来源：评论

学校读者我要写书评

暂无评论

Cycle Self-Refinement for Multi-Source Domain Adaptation 38

Cycle Self-Refinement for Multi-Source Domain Adaptation

引用

38th AAAI Conference on Artificial Intelligence, AAAI 2024

作者： Zhou, Chaoyang Wang, Zengmao Du, Bo Luo, Yong School of Computer Science Wuhan University China National Engineering Research Center for Multimedia Software Wuhan University China Institute of Artificial Intelligence Wuhan University China Key Laboratory of Multimedia and Network Communication Engineering Wuhan University China Hubei Luojia Laboratory China

ISBN: (纸本)1577358872

Multi-source domain adaptation (MSDA) aims to transfer knowledge from multiple source domains to the unlabeled target domain. In this paper, we propose a cycle self-refinement domain adaptation method, which progressively attempts to learn the dominant transferable knowledge in each source domain in a cycle manner. Specifically, several source-specific networks and a domain-ensemble network are adopted in the proposed method. The source-specific networks are adopted to provide the dominant transferable knowledge in each source domain for instance-level ensemble on predictions of the samples in target domain. Then these samples with high-confidence ensemble predictions are adopted to refine the domain-ensemble network. Meanwhile, to guide each source-specific network to learn more dominant transferable knowledge, we force the features of the target domain from the domain-ensemble network and the features of each source domain from the corresponding source-specific network to be aligned with their predictions from the corresponding networks. Thus the adaptation ability of source-specific networks and the domain-ensemble network can be improved progressively. Extensive experiments on Office-31, Office-Home and DomainNet show that the proposed method outperforms the state-of-the-art methods for most tasks. Copyright © 2024, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Error Analysis of Spherically Constrained Least Squares Reformulation in Solving the Stackelberg Prediction Game 38

Error Analysis of Spherically Constrained Least Squares Refo...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Li, Xiyuan Liu, Weiwei School of Computer Science Wuhan University China National Engineering Research Center for Multimedia Software Wuhan University China Institute of Artificial Intelligence Wuhan University China Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan University China

The Stackelberg prediction game (SPG) is a popular model for characterizing strategic interactions between a learner and an adversarial data provider. Although optimization problems in SPGs are often NP-hard, a notable special case involving the least squares loss (SPG-LS) has gained significant research attention recently [1, 2, 3]. The latest state-of-the-art method for solving the SPG-LS problem is the spherically constrained least squares reformulation (SCLS) method proposed in the work of [3]. However, the paper [3] lacks theoretical analysis on the error of the SCLS method, which limits its large-scale applications. In this paper, we investigate the estimation error between the learner obtained by the SCLS method and the actual learner. Specifically, we reframe the estimation error of the SCLS method as a Primary Optimization (PO) problem and utilize the Convex Gaussian min-max theorem (CGMT) to transform the PO problem into an Auxiliary Optimization (AO) problem. Subsequently, we provide a theoretical error analysis for the SCLS method based on this simplified AO problem. This analysis not only strengthens the theoretical framework of the SCLS method but also confirms the reliability of the learner produced by it. We further conduct experiments to validate our theorems, and the results are in excellent agreement with our theoretical predictions. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Predictive Generation for Digital Twin Channel:Long-Batch Time-Frequency Construction

引用

China communications 2025年第4期22卷 161-173页

作者： Che Chang Hu Jie Kang Honghui Rui Hua Lyu Xingzai Wang Bo School of Information and Communication Engineering University of Electronic Science and Technology of ChinaChengdu 611731China State Key Laboratory of Mobile Network and Mobile Multimedia Technology ZTE CorporationShenzhen 518055China

Wireless communication systems that incorporate digital twin(DT)alongside artificial intelligence(AI)are expected to transform 6G networks by providing advanced features for predictive modeling and decision *** key component is the creation of DT channels,which form the basis for upcoming ***,the existing work of channel predictive generation only considers time dimension,distribution-oriented or multi-step slidingwindow prediction schemes,which is not accurate and efficient for real-time DT communication ***,we propose the wireless channel generative adversarial network(WCGAN)to tackle the issue of generating authentic long-batch channels for DT *** generator based on convolutional neural networks(CNN)extracts features from both the time and frequency domains to better capture the *** loss function is designed to ensure that the generated channels consistently match the physical channels over an extended period while sharing the same probability ***,the accumulating error from the slicing window has been *** simulation demonstrates that an accurate and efficient DT channel can be generated by employing our proposed WCGAN in various scenarios.

关键词： channel generation channel prediction deep learning digital twin(DT) generative adversarial network(GAN)

来源：评论

学校读者我要写书评

暂无评论

Parameter Disparities Dissection for Backdoor Defense in Heterogeneous Federated Learning 38

Parameter Disparities Dissection for Backdoor Defense in Het...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Huang, Wenke Ye, Mang Shi, Zekun Wan, Guancheng Li, He Du, Bo National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence Hubei Key Laboratory of Multimedia and Network Communication Engineering School of Computer Science Wuhan University Wuhan China Taikang Center for Life and Medical Sciences Wuhan University Wuhan China

Backdoor attacks pose a serious threat to federated systems, where malicious clients optimize on the triggered distribution to mislead the global model towards a predefined target. Existing backdoor defense methods typically require either homogeneous assumption, validation datasets, or client optimization conflicts. In our work, we observe that benign heterogeneous distributions and malicious triggered distributions exhibit distinct parameter importance degrees. We introduce the Fisher Discrepancy Cluster and Rescale (FDCR) method, which utilizes Fisher Information to calculate the degree of parameter importance for local distributions. This allows us to reweight client parameter updates and identify those with large discrepancies as backdoor attackers. Furthermore, we prioritize rescaling important parameters to expedite adaptation to the target distribution, encouraging significant elements to contribute more while diminishing the influence of trivial ones. This approach enables FDCR to handle backdoor attacks in heterogeneous federated learning environments. Empirical results on various heterogeneous federated scenarios under backdoor attacks demonstrate the effectiveness of our method. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

FedSSP: Federated Graph Learning with Spectral Knowledge and Personalized Preference 38

FedSSP: Federated Graph Learning with Spectral Knowledge and...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Tan, Zihan Wan, Guancheng Huang, Wenke Ye, Mang National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence Hubei Key Laboratory of Multimedia and Network Communication Engineering School of Computer Science Wuhan University Wuhan China Taikang Center for Life and Medical Sciences Wuhan University Wuhan China

Personalized Federated Graph Learning (pFGL) facilitates the decentralized training of Graph Neural networks (GNNs) without compromising privacy while accommodating personalized requirements for non-IID participants. In cross-domain scenarios, structural heterogeneity poses significant challenges for pFGL. Nevertheless, previous pFGL methods incorrectly share non-generic knowledge globally and fail to tailor personalized solutions locally under domain structural shift. We innovatively reveal that the spectral nature of graphs can well reflect inherent domain structural shifts. Correspondingly, our method overcomes it by sharing generic spectral knowledge. Moreover, we indicate the biased message-passing schemes for graph structures and propose the personalized preference module. Combining both strategies, we propose our pFGL framework FedSSP which Shares generic Spectral knowledge while satisfying graph Preferences. Furthermore, We perform extensive experiments on cross-dataset and cross-domain settings to demonstrate the superiority of our framework. The code is available at https://***/OakleyTan/FedSSP. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：