Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,932 papers · 148 categories

Trend · papers per month

2.3%4.5%6.8%9.1% · Dec 199419922001200920172026
48 results for fashion search

Fashion preference is a fuzzy concept that depends on customer taste, prevailing norms in fashion product/style, henceforth used interchangeably, and a customer's perception of utility or fashionability, yet fashion e-retail relies on algorithmically generated search and recommendation systems that process structured d…

2018-06-30abs ↗pdf ↗

Method retrieves similar fashion items from images and text, enabling style refinement.

problem Lack of intuitive, interactive refinement in search engines for fashion items.
method Joint visual-textual embedding training, Mini-Batch Match Retrieval, attribute extraction.
result Improved performance in multimodal style search, demonstrated through benchmark.

Paper builds LETOR models for e-commerce, segmenting queries and optimizing search results.

problem Optimizing search results for e-commerce platforms.
method Segmenting queries into broad and narrow, using denoising auto-encoders and skip-gram embeddings, employing various feature types.
result Specialized models for broad and narrow queries outperform a combined model.

One-shot neural architecture search limits depth search space and prunes networks for better performance and uncertainty.

problem Finding optimal depth in residual networks for efficient training and inference.
method Formulated a variational objective to approximate the depth distribution and pruned networks based on this distribution.
result Pruned networks achieve competitive accuracy with unpruned networks and better uncertainty calibration.

LA-MCTS learns search space partition for black-box optimization using Monte Carlo Tree Search.

problem High-dimensional black-box optimization challenges.
method LA-MCTS recursively splits search space into regions with high/low function values, learns nonlinear partition and local models online.
result LA-MCTS achieves strong performance in black-box optimization and reinforcement learning benchmarks, especially for high-dimensional problems.

Having a sequence-to-sequence model which can operate in an online fashion is important for streaming applications such as Voice Search. Neural transducer is a streaming sequence-to-sequence model, but has shown a significant degradation in performance compared to non-streaming models such as Listen, Attend and Spell (…

2017-12-05abs ↗pdf ↗

The causal discovery of Bayesian networks is an active and important research area, and it is based upon searching the space of causal models for those which can best explain a pattern of probabilistic dependencies shown in the data. However, some of those dependencies are generated by causal structures involving varia…

2016-07-22abs ↗pdf ↗

Genealogy research is the study of family history using available resources such as historical records. Ancestry provides its customers with one of the world's largest online genealogical index with billions of records from a wide range of sources, including vital records such as birth and death certificates, census re…

2019-02-27abs ↗pdf ↗

Tensor decomposition has been extensively used as a tool for exploratory analysis. Motivated by neuroscience applications, we study tensor decomposition with Boolean factors. The resulting optimization problem is challenging due to the non-convex objective and the combinatorial constraints. We propose Binary Matching P…

2018-10-10abs ↗pdf ↗

The paper proposes an iterative approach to batch reinforcement learning for safer and more informative data collection.

problem Learning policies that are too rigid and do not adapt to new data.
method Safe diversified model-based policy search in an iterative batch reinforcement learning framework.
result Improved learned policies through continuous data collection and adaptation.

MCD automates counterfactual design searches for multi-modal tasks.

problem Designing for multi-objective goals and complex constraints.
method Model-agnostic counterfactual search method for multi-modal design modifications.
result MCD streamlines and automates counterfactual search, recommending effective design modifications.

Widespread applications of deep learning have led to a plethora of pre-trained neural network models for common tasks. Such models are often adapted from other models via transfer learning. The models may have varying training sets, training algorithms, network architectures, and hyper-parameters. For a given applicati…

2019-03-02abs ↗pdf ↗

Most artificial intelligence models have limiting ability to solve new tasks faster, without forgetting previously acquired knowledge. The recently emerging paradigm of continual learning aims to solve this issue, in which the model learns various tasks in a sequential fashion. In this work, a novel approach for contin…

2018-05-31abs ↗pdf ↗

The fashion industry is establishing its presence on a number of visual-centric social media like Instagram. This creates an interesting clash as fashion brands that have traditionally practiced highly creative and editorialized image marketing now have to engage with people on the platform that epitomizes impromptu, r…

2017-04-13abs ↗pdf ↗

This study examines how fashion consumption affects self-confidence and buying behavior in Iranian consumers.

problem Understanding the role of self-confidence in fashion buying behavior.
method A questionnaire was used to collect data from 400 consumers in Tehran's clothing market. Structural equations and factor analysis were employed to test the model.
result Interest in fashion, personal taste, utilitarianism, and new products positively impact self-confidence, and self-confidence positively impacts fashion buying behavior.

Undergraduate thesis explores topological barriers to compact Ricci solitons in 4D.

problem Finding topological obstructions to compact gradient shrinking Ricci solitons in dimension four.
method Discussion of background material, introduction of new problem, exploration of limitations of current results.
result Introduction of new problem and limitations of current results in extending Hitchin-Thorpe inequality.

This paper removes near-duplicates from Fashion-MNIST to improve testing accuracy.

problem Near-duplicate images in Fashion-MNIST increase testing accuracy, reducing dataset quality.
method Identified and removed near-duplicate images between training and testing sets.
result Improved dataset quality for better testing accuracy in machine learning models.

We use customer demand data for fashion articles on Myntra, and derive a fashionability or style quotient, which represents customer demand for the stylistic content of a fashion article, decoupled with its commercials (price, offers, etc.). We demonstrate learning for assortment planning in fashion that would aim to k…

2018-06-28abs ↗pdf ↗

HERMES model predicts nonstationary fashion trends using social media data.

problem Forecasting nonstationary fashion time series for optimal inventory decisions.
method Hybrid model combining parametric models, seasonal components, and recurrent neural networks with external signals.
result State-of-the-art results on fashion dataset and M4 competition time series.

This work proposes splitting deep neural networks into smaller sub-networks for faster and more efficient distillation.

problem Challenges in training deep neural networks, including local optima, gradient issues, and computational demands.
method Proposes a non-end-to-end distillation approach by splitting networks into smaller, independent sub-networks (neighbourhoods).
result Independent training of smaller sub-networks can speed up distillation and improve efficiency in various applications.

Lifted Relational Neural Networks (LRNNs) describe relational domains using weighted first-order rules which act as templates for constructing feed-forward neural networks. While previous work has shown that using LRNNs can lead to state-of-the-art results in various ILP tasks, these results depended on hand-crafted ru…

2017-10-05abs ↗pdf ↗

With inspiration from Random Forests (RF) in the context of classification, a new clustering ensemble method---Cluster Forests (CF) is proposed. Geometrically, CF randomly probes a high-dimensional data cloud to obtain "good local clusterings" and then aggregates via spectral clustering to obtain cluster assignments fo…

2011-04-14abs ↗pdf ↗

Recently, machine learning algorithms have successfully entered large-scale real-world industrial applications (e.g. search engines and email spam filters). Here, the CPU cost during test time must be budgeted and accounted for. In this paper, we address the challenge of balancing the test-time cost and the classifier …

2012-10-09abs ↗pdf ↗

We introduce a new dataset of 293,008 high definition (1360 x 1360 pixels) fashion images paired with item descriptions provided by professional stylists. Each item is photographed from a variety of angles. We provide baseline results on 1) high-resolution image generation, and 2) image generation conditioned on the gi…

2018-06-21abs ↗pdf ↗

Manifold Learning is a class of algorithms seeking a low-dimensional non-linear representation of high-dimensional data. Thus manifold learning algorithms are, at least in theory, most applicable to high-dimensional data and sample sizes to enable accurate estimation of the manifold. Despite this, most existing manifol…

2016-03-09abs ↗pdf ↗

Reactmine infers chemical reactions from time series data, overcoming sparse model limitations.

problem Inferring chemical reaction networks from time series data, especially when initial conditions are not varied.
method Sequential reaction inference in a search tree, ranking and re-optimizing kinetics.
result Reactmine successfully infers preponderant regulations in real datasets, matching model-based analyses.