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

41st International Conference on Machine Learning, ICML 2024

作者： Ma, Xinsong Zou, Xin Liu, Weiwei 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 Wuhan China

Out-of-distribution (OOD) detection task plays the key role in reliable and safety-critical applications. Existing researches mainly devote to designing or training the powerful score function but overlook investigating the decision rule based on the proposed score function. Different from previous work, this paper aims to design a decision rule with rigorous theoretical guarantee and well empirical performance. Specifically, we provide a new insight for the OOD detection task from a hypothesis testing perspective and propose a novel generalized Benjamini Hochberg (g-BH) procedure with empirical p-values to solve the testing problem. Theoretically, the g-BH procedure controls false discovery rate (FDR) at pre-specified level. Furthermore, we derive an upper bound of the expectation of false positive rate (FPR) for the g-BH procedure based on the tailed generalized Gaussian distribution family, indicating that the FPR of g-BH procedure converges to zero in probability. Finally, the extensive experimental results verify the superiority of g-BH procedure over the traditional threshold-based decision rule on several OOD detection benchmarks. Copyright 2024 by the author(s)

关键词：

来源：评论

学校读者我要写书评

暂无评论

Sequential Kernel Goodness-of-fit Testing 41

Sequential Kernel Goodness-of-fit Testing

引用

41st International Conference on Machine Learning, ICML 2024

作者： Zhou, Zhengyu Liu, Weiwei 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 Wuhan China

Goodness-of-fit testing, a classical statistical tool, has been extensively explored in the batch setting, where the sample size is ***, practitioners often prefer methods that adapt to the complexity of a problem rather than fixing the sample size *** batch tests are generally unsuitable for streaming data, as valid inference after data peeking requires multiple testing corrections, resulting in reduced statistical *** address this issue, we delve into the design of consistent sequential goodness-of-fit *** the principle of testing by betting, we reframe this task as selecting a sequence of payoff functions that maximize the wealth of a fictitious bettor, betting against the null in a repeated *** conduct experiments to demonstrate the adaptability of our sequential test across varying difficulty levels of problems while maintaining control over type-I errors. Copyright 2024 by the author(s)

关键词：

来源：评论

学校读者我要写书评

暂无评论

ViF-SD2E: a robust weakly-supervised framework for neural decoding

引用

Neural Computing and Applications 2025年第9期37卷 6645-6661页

作者： Feng, Jingyi Luo, Yong Song, Shuang Hu, Han National Engineering Research Center for Multimedia Software School of Computer Science Wuhan University Wuhan430072 China School of Information and Electronics Beijing Institute of Technology Beijing100081 China

Neural decoding plays a vital role in the interaction between the brain and the outside world. Our task in this paper is to decode the movement track of a finger directly based on the neural data. Existing neural decoding solutions primarily perform some preprocessing operations on neural data before feeding them into existing models (such as LSTM) for decoding. However, these solutions either are prone to overfitting or cannot well exploit the spatial and temporal information. In our previous observations, there is a symmetrical phenomenon between the unsupervised decoded trajectory and the ground truth trajectory within the activity space. This precisely motivates us to propose (or derive) a robust weakly-supervised framework (or model structure), called ViF-SD2E, for neural decoding. In particular, it consists of a space-division (SD) module and an exploration–exploitation (2E) strategy, to effectively exploit both the spatial information of the outside world and the temporal information of neural activity, where the SD2E output is analogized with the weak 0/1 vision feedback (ViF) label for training. Extensive experiments demonstrate the effectiveness of our method, which can sometimes be comparable to supervised counterparts. Therefore, we redirect our attention to the information (hidden in data) ViF-SD2E conveys to us. In other words, we believe that the advantage of ViF-SD2E lies in the fact that its processing steps are objectively determined by the inherent attributes (i.e., symmetry) of the neural data, or rather, the model structure is fixed. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： Space division multiple access

来源：评论

学校读者我要写书评

暂无评论

Balancing Privacy and Performance: A Many-in-One Approach for Image Anonymization 39

Balancing Privacy and Performance: A Many-in-One Approach fo...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Jia, Xuemei Du, Jiawei Wei, Hui Xue, Ruinian Wang, Zheng Zhu, Hongyuan Chen, Jun National Engineering Research Center for Multimedia Software School of Computer Science Wuhan University China Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan University China A*STAR Singapore A*STAR Singapore

ISBN: (纸本)157735897X

The effective utilization of data through Deep Neural Networks (DNNs) has profoundly influenced various aspects of society. The growing demand for high-quality, particularly personalized, data has spurred research efforts to prevent data leakage and protect privacy in recent years. Early privacy-preserving methods primarily relied on instance-wise modifications, such as erasing or obfuscating essential features for de-identification. However, this approach highlights an inherent trade-off: minimal modification offers insufficient privacy protection, while excessive modification significantly degrades task performance. In this paper, we propose a novel Recombining for Obfuscation (FRO) approach to address this trade-off. Unlike existing methods that generate one anonymized instance by perturbing the original data on a one-to-one basis, our FRO approach generates an anonymized instance by reassembling mixed id-related features from multiple original data sources on a many-in-one basis. Instead of introducing additional noise for de-identification, our approach leverages the existing non-polluted features from other instances to anonymize data. Extensive experiments on identity identification tasks demonstrate that FRO outperforms previous state-of-the-art methods, not only in utility performance but also in visual anonymization. Copyright © 2025, Association for the Advancement of Artificial Intelligence.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Build Yourself Before Collaboration: Vertical Federated Learning With Limited Aligned Samples

引用

IEEE Transactions on Mobile Computing 2025年第7期24卷 6503-6516页

作者： Shen, Wei Ye, Mang Yu, Wei Yuen, Pong C. Wuhan University National Engineering Research Center for Multimedia Software School of Computer Science Wuhan430072 China Hong Kong Baptist University Department of Computer Science Kowloon Tsai Hong Kong

Vertical Federated Learning (VFL) has emerged as a crucial privacy-preserving learning paradigm that involves training models using distributed features from shared samples. However, the performance of VFL can be hindered when the number of shared or aligned samples is limited, a common issue in mobile environments where user data are diverse and unaligned across multiple devices. Existing approaches use feature generation and pseudo-label estimation for unaligned samples to address this issue, unavoidably introducing noise during the generation process. In this work, we propose Local Enhanced Effective Vertical Federated Learning (LEEF-VFL), which fully utilizes unaligned samples in the local learning before collaboration. Unlike previous methods that overlook private labels owned by each client, we leverage these private labels to learn from all local samples, constructing robust local models to serve as solid foundations for collaborative learning. Additionally, we reveal that the limited number of aligned samples introduces distribution bias from global data distribution. In this case, we propose to minimize the distribution discrepancies between the aligned samples and the global data distribution to enhance collaboration. Extensive experiments demonstrate the effectiveness of LEEF-VFL in addressing the challenges of limited aligned samples, making it suitable for VFL in mobile computing environments. © 2002-2012 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

The Reliability of OKRidge Method in Solving Sparse Ridge Regression Problems 38

The Reliability of OKRidge Method in Solving Sparse Ridge Re...

引用

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

FriendsQA: A New Large-Scale Deep Video Understanding Dataset with Fine-grained Topic Categorization for Story Videos 39

FriendsQA: A New Large-Scale Deep Video Understanding Datase...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Wu, Zhengqian Li, Ruizhe Xu, Zijun Wang, Zhongyuan Xiao, Chunxia Liang, Chao School of Computer Science Wuhan University China School of Cyber Science and Engineering Wuhan University China National Engineering Research Center for Multimedia Software Wuhan University China Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan University China

ISBN: (纸本)157735897X

Video question answering (VideoQA) aims to answer natural language questions according to the given videos. Although existing models perform well in the factoid VideoQA task, they still face challenges in deep video understanding (DVU) task, which focuses on story videos. Compared to factoid videos, the most significant feature of story videos is storylines, which are composed of complex interactions and long-range evolvement of core story topics including characters, actions and locations. Understanding these topics requires models to possess DVU capability. However, existing DVU datasets rarely organize questions according to these story topics, making them difficult to comprehensively assess VideoQA models' DVU capability of complex storylines. Additionally, the question quantity and video length of these dataset are limited by high labor costs of handcrafted dataset building method. In this paper, we devise a large language model based multi-agent collaboration framework, StoryMind, to automatically generate a new large-scale DVU dataset. The dataset, FriendsQA, derived from the renowned sitcom Friends with an average episode length of 1,358 seconds, contains 44.6K questions evenly distributed across 14 fine-grained topics. Finally, We conduct comprehensive experiments on 10 state-of-the-art VideoQA models using the FriendsQA dataset. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). 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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

WaterDiffusion: Learning a Prior-involved Unrolling Diffusion for Joint Underwater Saliency Detection and Visual Restoration 39

WaterDiffusion: Learning a Prior-involved Unrolling Diffusio...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Chang, Laibin Wang, Yunke Deng, Longxiang Du, Bo Xu, Chang 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 School of Computer Science The University of Sydney Sydney Australia

ISBN: (纸本)157735897X

Underwater salient object detection (USOD) plays a pivotal role in various vision-based marine exploration tasks. However, existing USOD techniques face the dilemma of object mislocalization and imprecise boundaries due to the complex underwater environment. The quality degradation of raw underwater images (caused by selective absorption and medium scattering) makes it challenging to perform instance detection directly. One conceivable approach involves initially removing visual disturbances through underwater image enhancement (UIE), followed by saliency detection. However, this two-stage approach neglects the potential positive impact of the restoration procedure on saliency detection due to it executes in a cascade. Based on this insight, we propose a generalized prior-involved diffusion model, called WaterDiffusion for collaborative underwater saliency detection and visual restoration. Specifically, we first propose a revised self-attention joint diffusion, which embeds dynamic saliency masks into the diffusive network as latent features. By extending the underwater degradation prior into the multiscale decoder, we innovatively exploit optical transmission maps to aid in localizing underwater salient objects. Then, we further design a gate-guided binary indicator to select either normalized or raw channels for improving feature generalization. Finally, the Half-quadratic Splitting is introduced into the unfolding sampling to refine saliency masks iteratively. Comprehensive experiments demonstrate the superior performance of WaterDiffusion over state-of-the-art methods in both quantitative and qualitative evaluations. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Underwater photography

来源：评论

学校读者我要写书评

暂无评论

Watch You under Low-Resolution and Low-Illumination: Face Enhancement via Bi-Factor Degradation Decoupling

引用

IEEE Transactions on Circuits and Systems for Video Technology 2024年第5期34卷 3481-3495页

作者： Ding, Xin Wang, Zheng Fang, Jing Shu, Zhenyu Hu, Ruimin Lin, Chia-Wen NingboTech University School of Computer and Data Engineering Ningbo315100 China Wuhan University National Engineering Research Center for Multimedia Software School of Computer Wuhan430072 China National Tsing Hua University Department of Electrical Engineering The Institute of Communications Engineering Hsinchu300044 Taiwan

Face enhancement aims to improve low-quality face images to a higher-quality level. However, in real-world nighttime scenes, complex degradation factors often affect these images, making it challenging to preserve important facial details. Existing image enhancement algorithms typically focus on independently conducting image super-resolution and brightness enhancement, assuming a fixed degradation level based on simulated training datasets. Nonetheless, real nighttime scenes involve complex degradation processes, where degradation factors dynamically and variably manifest. Therefore, achieving effective face enhancement in such scenarios is particularly daunting. This work analyzes and unveils the multiple factors of low resolution and low illumination during degradation. Based on this analysis, we propose a Bi-factor Degradation Decoupling network. Our method leverages a decoupling network to generate qualitative and quantitative features corresponding to each factor's degradation degree in the low-quality environment. These features are then combined with robust facial feature constraints to recover the details of low-quality faces. Extensive experiments demonstrate that our method surpasses state-of-the-art approaches in both enhancement and face super-resolution. © 1991-2012 IEEE.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：