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,695 papers · 148 categories

Trend · papers per month

112223335446 · Jun 202019922001200920172026
48 results for Search systems

Extends NAS to learn both intra-cell and inter-cell architectures for language modeling.

problem Limited NAS systems restrict search to recurrent or convolutional cells.
method Designs a joint learning method to perform intra-cell and inter-cell NAS simultaneously.
result Significantly outperforms a strong baseline on PTB and WikiText data.

Neural architecture search (NAS) has been proposed to automatically tune deep neural networks, but existing search algorithms, e.g., NASNet, PNAS, usually suffer from expensive computational cost. Network morphism, which keeps the functionality of a neural network while changing its neural architecture, could be helpfu…

2018-06-27abs ↗pdf ↗

Neural architecture search methods are able to find high performance deep learning architectures with minimal effort from an expert. However, current systems focus on specific use-cases (e.g. convolutional image classifiers and recurrent language models), making them unsuitable for general use-cases that an expert migh…

2019-09-30abs ↗pdf ↗

This paper introduces Seeker, a system that allows users to interactively refine search rankings in real time, through feedback in the form of likes and dislikes. When searching online, users may not know how to accurately describe their product of choice in words. An alternative approach is to search an embedding spac…

2019-05-17abs ↗pdf ↗

Optimizes search times by resetting agents when a threshold is reached.

problem Improving search efficiency in systems with thresholds.
method Develops a framework for correlated stochastic processes with threshold resetting.
result Optimal resetting can prevent larger losses and is applicable to various stochastic systems.

This paper introduces a new system for discovering patterns in morphogenetic systems using modular architecture and unsupervised learning.

problem Discovering novel patterns in morphogenetic systems is challenging and often relies on manual tuning.
method Introduces a hierarchical, modular architecture for unsupervised learning of diverse representations combined with goal exploration algorithms.
result The new system efficiently adapts diversity search towards user preferences with minimal feedback.

SIM models user interests from long sequential behavior data, improving click-through rate prediction.

problem Challenges in capturing user interests with long user behavior sequences.
method SIM uses a cascaded search paradigm with two units: General Search Unit and Exact Search Unit.
result SIM achieves significant CTR and RPM lifts in Alibaba's display advertising system.

Current Neural Architecture Search techniques can suffer from a few shortcomings, including high computational cost, excessive bias from the search space, conceptual complexity or uncertain empirical benefits over random search. In this paper, we present ImmuNeCS, an attempt at addressing these issues with a method tha…

2019-11-18abs ↗pdf ↗

Face recall is a basic human cognitive process performed routinely, e.g., when meeting someone and determining if we have met that person before. Assisting a subject during face recall by suggesting candidate faces can be challenging. One of the reasons is that the search space - the face space - is quite large and lac…

2016-04-28abs ↗pdf ↗

Advocates a local feedback approach for RL in unknown systems.

problem Finding optimal feedback laws in unknown nonlinear dynamical systems.
method Searches over a local feedback representation consisting of an open-loop sequence and an optimal linear feedback law.
result Results in highly efficient training and superior performance compared to global methods.

Talent search and recommendation systems at LinkedIn strive to match the potential candidates to the hiring needs of a recruiter or a hiring manager expressed in terms of a search query or a job posting. Recent work in this domain has mainly focused on linear models, which do not take complex relationships between feat…

2018-09-17abs ↗pdf ↗

Polynomial inequalities lie at the heart of many mathematical disciplines. In this paper, we consider the fundamental computational task of automatically searching for proofs of polynomial inequalities. We adopt the framework of semi-algebraic proof systems that manipulate polynomial inequalities via elementary inferen…

2019-06-04abs ↗pdf ↗

Symbolic regression is a type of discrete optimization problem that involves searching expressions that fit given data points. In many cases, other mathematical constraints about the unknown expression not only provide more information beyond just values at some inputs, but also effectively constrain the search space. …

2019-01-23abs ↗pdf ↗

Optimizes ad pruning in sponsored search systems using reinforcement learning.

problem How to efficiently select top K ads from N candidates to maximize revenue.
method Model-free reinforcement learning approach considering downstream as a black-box environment.
result Remarkable improvements in revenue achieved through reinforcement learning.

Face recognition systems are vulnerable to composite face reconstruction attacks.

problem Vulnerability of face recognition systems to composite face reconstruction attacks.
method Assumed attacker uses composite face parts to reconstruct faces faster and more efficiently.
result Current face recognition systems are extremely vulnerable to random search attacks.

FiGS searches over a larger space of architectures for efficient mobile models.

problem Designing small, efficient deep networks for mobile devices.
method Differentiable search method using sparse regularization and Logistic-Sigmoid distribution.
result FiGS produces state-of-the-art parameter-efficient models on ImageNet and improves object detection performance.

In this paper, we present a real-world conversational AI system to search for and book hotels through text messaging. Our architecture consists of a frame-based dialogue management system, which calls machine learning models for intent classification, named entity recognition, and information retrieval subtasks. Our ch…

2019-08-27abs ↗pdf ↗

Automates supervised learning pipeline design with matrix and tensor factorization.

problem Designing effective supervised learning pipelines with many choices.
method Uses matrix and tensor factorization to model pipeline search space and develops greedy experiment design protocols.
result Demonstrates the effectiveness of the approach on real-world classification problems.

New algorithm converges to optimal filter for predicting linear dynamical systems.

problem Direct policy search for optimal dynamic filters in partially observable systems.
method Regularizer enforcing informativity over filter states.
result Gradient descent converges to globally optimal solution at rate O(1/T).

Contextual policy search allows adapting robotic movement primitives to different situations. For instance, a locomotion primitive might be adapted to different terrain inclinations or desired walking speeds. Such an adaptation is often achievable by modifying a small number of hyperparameters. However, learning, when …

2015-11-13abs ↗pdf ↗

TIP-Search optimizes market prediction accuracy and timeliness under uncertain load.

problem Real-time market prediction requires accurate predictions before a deadline.
method Filters feasible models, dispatches workers, trades accuracy for deadline risk.
result Optimized pool achieves 0.991 timely accuracy and 0.994 raw accuracy.

The study aims to explore the strength of causal relationship between stock price search interest and real stock market outcomes on worldwide equity market indices. Such a phenomenon could also be mediated by investor behavior and extent of news coverage. The stock-specific internet search trends data and corresponding…

2018-04-05abs ↗pdf ↗

Bardo Composer generates tabletop RPG music based on player speech.

problem Creating immersive background music for tabletop RPGs.
method Speech recognition, emotion classification, and music generation using a novel beam search algorithm.
result Generated music pieces can be accurately identified by human subjects as conveying the intended emotion.

FIVES generates high-order interactive features efficiently and effectively.

problem Automating the generation of high-order interactive features in tabular data.
method Formulates interactive feature generation as edge search on a feature graph, using a GNN and adjacency tensor.
result FIVES outperforms state-of-the-art methods in various datasets and real-world applications.

OKRidge solves sparse ridge regression problems for nonlinear systems.

problem Identifying sparse governing equations for nonlinear dynamical systems.
method OKRidge algorithm using saddle point formulation and ADMM-based approach with efficient proximal operators.
result OKRidge achieves provable optimality with significantly faster run times than Gurobi.

AutoOD automates outlier detection using curiosity-guided search and self-imitation learning.

problem Automated outlier detection for complex tasks with big data.
method Curiosity-guided search strategy and self-imitation learning.
result AutoOD identifies optimal neural network models with superior performance.

Efficient Maximum Inner Product Search (MIPS) is an important task that has a wide applicability in recommendation systems and classification with a large number of classes. Solutions based on locality-sensitive hashing (LSH) as well as tree-based solutions have been investigated in the recent literature, to perform ap…

2015-07-21abs ↗pdf ↗