In recent years, the digital cryptocurrency market has witnessed rapid development, but its asset allocation function has yet to be verified. In this paper, DCC-GARCH model is used to estimate the dynamic correlation ...
详细信息
Inspired by the fact that certain randomization schemes incorporated into the stochastic (proximal) gradient methods allow for a large reduction in computational time, we incorporate such a scheme into stochastic alte...
详细信息
Inspired by the fact that certain randomization schemes incorporated into the stochastic (proximal) gradient methods allow for a large reduction in computational time, we incorporate such a scheme into stochastic alternating direction method of multipliers (ADMM), yielding a faster stochastic alternating direction method (FSADM) for solving a class of large scale convex composite problems. In the numerical experiments, we observe a reduction of this method in computational time compared to previous methods. More importantly, we unify the stochastic ADMM for solving general convex and strongly convex composite problems (i.e., the iterative scheme does not change when the the problem goes from strongly convex to general convex). In addition, we establish the convergence rates of FSADM for these two cases.
knowledge Graph (KG)-augmented Large Language Models (LLMs) have recently propelled significant advances in complex reasoning tasks, thanks to their broad domain knowledge and contextual awareness. Unfortunately, curr...
详细信息
The demand for products in the retail industry is often characterized by intermittent and volatile patterns. Specifically, at the SKU level, the demand exhibits intermittent and lumpy behavior, which presents challeng...
详细信息
Image sharpening prediction plays a significant role in image restoration, forensics, and computer vision. This work proposes a new method for detecting sharpening and indexing in digital images. Images initially unde...
详细信息
This paper explores a novel multi-modal alternating learning paradigm pursuing a reconciliation between the exploitation of uni-modal features and the exploration of cross-modal interactions. This is motivated by the ...
详细信息
This paper explores a novel multi-modal alternating learning paradigm pursuing a reconciliation between the exploitation of uni-modal features and the exploration of cross-modal interactions. This is motivated by the fact that current paradigms of multi-modal learning tend to explore multi-modal features simultaneously. The resulting gradient prohibits further exploitation of the features in the weak modality, leading to modality competition, where the dominant modality overpowers the learning process. To address this issue, we study the modality-alternating learning paradigm to achieve reconcilement. Specifically, we propose a new method called ReconBoost to update a fixed modality each time. Herein, the learning objective is dynamically adjusted with a reconcilement regularization against competition with the historical models. By choosing a KL-based reconcilement, we show that the proposed method resembles Friedman's Gradient-Boosting (GB) algorithm, where the updated learner can correct errors made by others and help enhance the overall performance. The major difference with the classic GB is that we only preserve the newest model for each modality to avoid overfitting caused by ensembling strong learners. Furthermore, we propose a memory consolidation scheme and a global rectification scheme to make this strategy more effective. Experiments over six multi-modal benchmarks speak to the efficacy of the method. We release the code at https://***/huacong/ReconBoost. Copyright 2024 by the author(s)
This paper has sorted out the general logic of the impact of COVID-19 on energy consumption. In the short term, the epidemic has forced governments to adopt different levels of lockdown measures. The total electricity...
详细信息
Over the past decades, three-dimensional(3D) face recognition has developed rapidly due to its intrinsic invariance to pose and illumination changes. Yet despite this, deep learning is rarely used in 3D face recogniti...
详细信息
Over the past decades, three-dimensional(3D) face recognition has developed rapidly due to its intrinsic invariance to pose and illumination changes. Yet despite this, deep learning is rarely used in 3D face recognition due to lack of training data. Noting that the majority of the recognition processes are based on facial depth map instead of real 3D data, we focus on the generation of facial depth map to surmount the shortage of training data. In this paper, we present a novel paradigm, Facial Depth Descend, which generates facial depth map from existing 3D face data. The key to this generation paradigm is to recombine facial components from existing faces and thereafter generate brand new faces based on them. We then propose a learning framework RPC to generate recognition-friendly faces. First, it extracts three facial components (eyes, nose and mouth) from the 3D data of real faces. Then, with these components as input, a Relative Location Estimator (RLE) is used to predict the relative location among them so that they can be composed in a reasonable manner. Finally, the method feeds a Pix2Pix network with these composed facial components to extrapolate areas surrounding them and output a full facial depth map. We here enforce an identity preserving loss on the generation network to make the facial depth map more discriminative and favorable for recognition tasks. Since we can choose different identities' different components as input, RPC is theoretically able to generate a vast number of novel 2.5D faces. More specifically, RPC can generate an enlarged face dataset as large as N-3 identities, where N is the number of identities in the original one. Experiments show that, adding the generated depth maps to the training dataset can help improve the recognition rate in 2.5D face recognition. (C) 2021 Published by Elsevier B.V.
Session-based recommendation aims to recommend the next item of an anonymous user session. Previous models consider only the current session and learn both of the user's global and local preferences. These models ...
详细信息
Session-based recommendation aims to recommend the next item of an anonymous user session. Previous models consider only the current session and learn both of the user's global and local preferences. These models fail to consider an important source of information, i.e., the co-occurrence pattern of items in different sessions. The co-occurrence patterns elicit the trajectory of other similar users and can improve the recommendation performance. We propose an Item Co-occurrence Graph Augmented Session-based Recommendation (IC-GAR) model, a novel session-based recommendation model that augments the representations of the current session with session co-occurrence patterns. IC-GAR consists of three modules: Encode Module, Session Co-occurrence Module and Prediction Module. The Encoder Module learns both of the user's global and local preference from the current session using Gate Recurrent Units (GRU). The Session Co-occurrence Module uses a modified variant of Graph Convolutional Network (GCN) to model higher order interactions between the item transition patterns in the training sessions. By aggregating the GCN representation of items of the current session, session co-occurrence representation is learned. The Prediction Module decomposes global preference, local preference and session co-occurrence to predict the probability scores of candidate items. Extensive experiments on three publicly available datasets are conducted to demonstrate the effectiveness of IC-GAR. 8.5-39.2% improvement are achieved across datasets in Precision @5, 10 and MRR@5, 10.
As an emerging form of marketing, live streaming has a positive effect on the ability of e-Commerce platforms to attract traffic and increase sales. It has become another important competitive area in the industry. Ba...
详细信息
暂无评论