Outfit Completion via Conditional Set Transformation

• URL: http://arxiv.org/abs/2311.16630v1
• Date: Tue, 28 Nov 2023 09:30:52 GMT
• Title: Outfit Completion via Conditional Set Transformation
• Authors: Takuma Nakamura, Yuki Saito, Ryosuke Goto
• Abstract summary: We formulate the outfit completion problem as a set retrieval task and propose a novel framework for solving this problem. The proposal includes a conditional set transformation architecture with deep neural networks and a compatibility-based regularization method. Experimental results on real data reveal that the proposed method outperforms existing approaches in terms of accuracy of the outfit completion task, condition satisfaction, and compatibility of completion results.
• Score: 10.075094678260625
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this paper, we formulate the outfit completion problem as a set retrieval task and propose a novel framework for solving this problem. The proposal includes a conditional set transformation architecture with deep neural networks and a compatibility-based regularization method. The proposed method utilizes a map with permutation-invariant for the input set and permutation-equivariant for the condition set. This allows retrieving a set that is compatible with the input set while reflecting the properties of the condition set. In addition, since this structure outputs the element of the output set in a single inference, it can achieve a scalable inference speed with respect to the cardinality of the output set. Experimental results on real data reveal that the proposed method outperforms existing approaches in terms of accuracy of the outfit completion task, condition satisfaction, and compatibility of completion results.

Related papers

• Scalable Permutation-Aware Modeling for Temporal Set Prediction [8.122126170969365]
  Temporal set prediction involves forecasting the elements that will appear in the next set, given a sequence of prior sets. Existing methods often rely on intricate architectures with substantial computational overhead. We introduce a novel and scalable framework that leverages permutation-equivariant and permutation-invariant transformations.
  arXiv  Detail & Related papers  (2025-04-23T23:14:35Z)
• A Fixed-Point Approach to Unified Prompt-Based Counting [51.20608895374113]
  This paper aims to establish a comprehensive prompt-based counting framework capable of generating density maps for objects indicated by various prompt types, such as box, point, and text. Our model excels in prominent class-agnostic datasets and exhibits superior performance in cross-dataset adaptation tasks.
  arXiv  Detail & Related papers  (2024-03-15T12:05:44Z)
• Enhancing Neural Subset Selection: Integrating Background Information into Set Representations [53.15923939406772]
  We show that when the target value is conditioned on both the input set and subset, it is essential to incorporate an textitinvariant sufficient statistic of the superset into the subset of interest. This ensures that the output value remains invariant to permutations of the subset and its corresponding superset, enabling identification of the specific superset from which the subset originated.
  arXiv  Detail & Related papers  (2024-02-05T16:09:35Z)
• Exploiting Inferential Structure in Neural Processes [15.058161307401864]
  Neural Processes (NPs) are appealing due to their ability to perform fast adaptation based on a context set. We provide a framework that allows NPs' latent variable to be given a rich prior defined by a graphical model.
  arXiv  Detail & Related papers  (2023-06-27T03:01:43Z)
• Range-Restricted Interpolation through Clausal Tableaux [0.0]
  We show how variations of range-restriction and also the Horn property can be passed from inputs to outputs of Craig in first-order logic. The proof system is clausal tableaux, which stems from first-order ATP.
  arXiv  Detail & Related papers  (2023-06-06T10:42:40Z)
• Generalization Bounds for Set-to-Set Matching with Negative Sampling [2.3859169601259347]
  The problem of matching two sets of multiple elements, namely set-to-set matching, has received a great deal of attention in recent years. This paper aims to perform a generalization error analysis in set-to-set matching to reveal the behavior of the model in that task.
  arXiv  Detail & Related papers  (2023-02-25T05:05:59Z)
• Conformal Prediction Sets with Limited False Positives [43.596058175459746]
  We develop a new approach to multi-label conformal prediction in which we aim to output a precise set of promising prediction candidates with a bounded number of incorrect answers. We demonstrate the effectiveness of this approach across a number of classification tasks in natural language processing, computer vision, and computational chemistry.
  arXiv  Detail & Related papers  (2022-02-15T18:52:33Z)
• Mini-Batch Consistent Slot Set Encoder for Scalable Set Encoding [50.61114177411961]
  We introduce a new property termed Mini-Batch Consistency that is required for large scale mini-batch set encoding. We present a scalable and efficient set encoding mechanism that is amenable to mini-batch processing with respect to set elements and capable of updating set representations as more data arrives.
  arXiv  Detail & Related papers  (2021-03-02T10:10:41Z)
• Automated Concatenation of Embeddings for Structured Prediction [75.44925576268052]
  We propose Automated Concatenation of Embeddings (ACE) to automate the process of finding better concatenations of embeddings for structured prediction tasks. We follow strategies in reinforcement learning to optimize the parameters of the controller and compute the reward based on the accuracy of a task model.
  arXiv  Detail & Related papers  (2020-10-10T14:03:20Z)
• Spatially Adaptive Inference with Stochastic Feature Sampling and Interpolation [72.40827239394565]
  We propose to compute features only at sparsely sampled locations. We then densely reconstruct the feature map with an efficient procedure. The presented network is experimentally shown to save substantial computation while maintaining accuracy over a variety of computer vision tasks.
  arXiv  Detail & Related papers  (2020-03-19T15:36:31Z)
• Learn to Predict Sets Using Feed-Forward Neural Networks [63.91494644881925]
  This paper addresses the task of set prediction using deep feed-forward neural networks. We present a novel approach for learning to predict sets with unknown permutation and cardinality. We demonstrate the validity of our set formulations on relevant vision problems.
  arXiv  Detail & Related papers  (2020-01-30T01:52:07Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.