NeuralArTS categorizes neural ops in a type system for NAS.
problem Manual optimization of search spaces for NAS is inefficient.
method Developed NeuralArTS, a type system for categorizing network ops.
result NeuralArTS can be applied to convolutional layers.
Improves search performance by transferring knowledge from recommender system.
problem Cold start and feedback loop problems in search retrieval.
method Zero-Shot Heterogeneous Transfer Learning framework.
result Significant improvements in relevance and user interactions over production system.
Seeker allows real-time feedback to refine search results.
problem Users struggle to accurately describe desired items in words.
method Interactive refinement of search results through user feedback.
result Seeker improves search quality through user feedback.
AMEIR automates recommender system design using NAS.
problem Manual feature and architecture engineering in recommender systems.
method Three-stage search space and tailored three-step pipeline.
result AMEIR outperforms manual and complex NAS methods.
Planetary exploration missions with Mars rovers are complicated, which generally require elaborated task planning by human experts, from the path to take to the images to capture. NASA has been using this process to acquire over 22 million images from the planet Mars. In order to improve the degree of automation and th…
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.
ImmuNeCS uses AI immune system to build neural committees for efficient deep learning model creation.
problem High computational cost and bias in Neural Architecture Search.
method Neural Committee Search using an artificial immune system to balance diversity and performance.
result ImmuNeCS consistently outperforms random search and ensembles yield better results within reasonable GPU budgets.
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…
This paper compares FAISS and FENSHSES for nearest neighbor search in Hamming space.
problem Comparing nearest neighbor search systems in Hamming space.
method Comprehensive evaluations of indexing speed, search latency, and RAM consumption.
result Better understanding of trade-offs between main memory and secondary memory systems.
A new language for neural architecture search decouples search spaces and algorithms.
problem Current neural architecture search methods are limited to specific use-cases and lack general-purpose constructs.
method Proposes a formal language for encoding search spaces over general computational graphs, allowing modular, composable, and reusable encodings.
result The language enables easy experimentation with different search spaces and algorithms without reinventing the wheel.
Machine learning improves searching for polynomial proofs.
problem Automatically searching for proofs of polynomial inequalities.
method Deep reinforcement learning guiding inference rules in semi-algebraic proof systems.
result Reduces the size of linear programs by several orders of magnitude.
GAMA is a user-friendly AutoML system for machine learning pipeline optimization.
problem Empowering users to control and optimize machine learning pipelines.
method Modular AutoML system with three search algorithms and two post-processing steps.
result GAMA allows users to track and control the search process for optimal machine learning pipelines.
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.
MICO uses mutual information co-training to improve selective search efficiency.
problem Efficiently search and route unseen queries in large-scale search systems.
method Mutual Information Co-training framework for selective search with minimal supervision.
result Significantly improves performance on multiple metrics of selective search.
Paper tackles diversity in Airbnb search results.
problem Show diverse results to improve user experience.
method Heuristic based approaches → Deep learning solution using RNNs.
result Novel deep learning solution improves diversity in search results.
Hotel booking chatbot handles daily tens of thousands of searches.
problem Improving hotel booking through conversational AI.
method Frame-based dialogue management system with ML models for intent, entity recognition, and info retrieval.
result Chatbot deployed on a commercial scale, handling hotel searches daily.
Neural Networks (NN) have been proposed in the past as an effective means for both modeling and control of systems with very complex dynamics. However, despite the extensive research, NN-based controllers have not been adopted by the industry for safety critical systems. The primary reason is that systems with learning…
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…
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…
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. …
Optimizes tree models for better beam search performance.
problem Beam search causes retrieval performance deterioration in tree models.
method Develops Bayes optimality and calibration under beam search, proposes a novel algorithm for optimal tree model learning.
result Eliminates the training-testing discrepancy in tree models.
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.
Paper improves EEG-based speech recognition using CTC and beam search.
problem Improving continuous speech recognition from EEG signals.
method Implemented CTC-based ASR system, initialized weights, used external language model, studied articulatory feature prediction.
result Enhanced performance of EEG-based speech recognition systems.
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.
This paper will explore the use of autoencoders for semantic hashing in the context of Information Retrieval. This paper will summarize how to efficiently train an autoencoder in order to create meaningful and low-dimensional encodings of data. This paper will demonstrate how computing and storing the closest encodings…
Test for fairness in IR systems based on protected variables.
problem Unfairness in IR systems due to correlation with protected variables.
method Statistical test for 'distribution parity' in top-K IR results.
result Ensures fairness in IR systems for all users.
Paper improves full-text search engines for fast exact NNS in binary codes.
problem Efficient nearest neighbor search in Hamming space for full-text search engines.
method Revisits and combines three techniques from information retrieval: bit operation, subs-code filtering, and data preprocessing with permutation.
result Significant speed-ups for NNS in binary codes over state-of-the-art term match approach.
New algorithms allow multiple robots to search efficiently without central coordination.
problem Efficiently locating targets in an unknown environment with multiple robots.
method SPATS and LATSI algorithms for asynchronous multi-agent active search.
result Multiple robots can independently make data-collection decisions without a central coordinator.
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 …
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…
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.
Search-oriented conversational systems rely on information needs expressed in natural language (NL). We focus here on the understanding of NL expressions for building keyword-based queries. We propose a reinforcement-learning-driven translation model framework able to 1) learn the translation from NL expressions to que…
ShrinkML uses RL to compress ASR models efficiently.
problem Large and complex ASR models reduce accuracy.
method Reinforcement Learning for compression of LSTM layers using SVD.
result RL-based compression achieves better accuracy than manual methods.
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.
A new search algorithm identifies causal effects from incomplete data.
problem Identifying causal effects from incomplete data sources.
method A search-based algorithm over do-calculus rules.
result The approach is complete for a wide range of identifiability problems.
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.
Automates optimizer design for diverse tasks efficiently.
problem Scalability, generability, and sample efficiency in optimizer search.
method Re-arranged optimizer space into a super-tree, applying tree traversal methods.
result Discover optimizers with only 128 evaluations, surpassing human-designed and prior methods.
Paper optimizes energy-based controller for swinging up a pendulum using entropy search.
problem Finding optimal parameters for energy-based controllers is hard.
method Bayesian optimization (Entropy Search) applied to energy-based controller design.
result Optimal controller improves performance of a swinging pendulum.
SANNS secures k-NNS queries and results without revealing them.
problem Securely searching for nearest neighbors without exposing sensitive data.
method Optimized linear scan and clustering-based algorithm with cryptographic primitives.
result SANNS achieves up to 31x faster response times and scales to 10 million entries.
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…