Deep learning models improve talent search at LinkedIn.
problem Match candidates to hiring needs using complex feature interactions.
method Deep and representation learning models, including neural network models and learning to rank approaches.
result Improved offline and online evaluation results for talent search systems.
Luck is crucial for success, talent alone isn't enough.
problem The role of luck and talent in achieving success.
method Agent-based model to simulate the role of luck and talent.
result Luck is more important than talent for success.
Paper identifies bias and strategic behavior in crowdsourced performance assessments.
problem Crowdsourced performance assessment risks personal interest introducing distortions.
method Developed a method to identify bias and strategic behavior using a rich dataset.
result Discovers a pattern of 'discriminatory generosity' in peer evaluation.
This study identifies financial risk paths in digital-transformed enterprises.
problem Identifying financial risks in digital-transformed enterprises.
method DEMATEL-ISM-MICMAC method.
result Political and economic environment affects enterprise's financial structure.
Predicting dance hits from 1985-2013 using musical features.
problem Predicting which songs will be dance hits.
method Built a database of dance hit songs with features, used multiple classifiers.
result Best model predicts top 10 dance hits with good accuracy.
The paper identifies collaborations in codebases using commit activity and language usage.
problem Identifying organic team interactions and collaborations in large codebases.
method Embedding and clustering commit activity, language usage, and code identifier topics.
result Restores engineering organization and reveals hidden collaborations.
Investment managers face harder choices in green stocks due to reduced performance variability.
problem Difficulty in deploying talent in green stocks due to reduced performance variability.
method Analysis of S&P 500 firms' greenhouse gas emission levels and peer performance ratios.
result Performance variability has decreased in green stocks, making it harder for managers to choose.
Tool to estimate research impact for low-resource institutions.
problem Costly databases limit access for third-world institutions.
method Machine Learning for data analysis and panel regression.
result Approximation of SCOPUS Impact Factor for free.
Employers actively look for talents having not only specific hard skills but also various soft skills. To analyze the soft skill demands on the job market, it is important to be able to detect soft skill phrases from job advertisements automatically. However, a naive matching of soft skill phrases can lead to false pos…
Orchestrating the Twin Transition in GBS: A Socio-Technical Framework
problem MNCs' need to harmonize digital efficiency with environmental stewardship
method Technology Roadmapping (TRM) with ICT-centric innovation ecosystem toolkit
result Central 'operational airlock' for GBS in harmonizing digital and environmental transformation
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.
This paper compares Grid Search, Random Search, and Genetic Algorithm for NAS.
problem Hyperparameter optimization for neural architecture search.
method Comparison of Grid Search, Random Search, and Genetic Algorithm.
result Genetic Algorithm outperforms Grid Search and Random Search in terms of accuracy and execution time.
Deep learning predicts baseball home runs with better accuracy.
problem Predicting player performance in baseball.
method Long Short-Term Memory (LSTM) neural network.
result LSTM outperformed other models in predicting home runs.
Efficient search methods can outperform random search on challenging tasks.
problem Comparing the performance of efficient and random search methods in neural architecture search.
method Comparison of weight sharing and random search methods on progressively larger search spaces for image classification and detection.
result Efficient search methods can provide substantial gains over random search on large, realistic tasks.
A new framework generates large hierarchical search spaces for neural architectures.
problem Discovering neural architectures from simple blocks is hard.
method Context-free grammars for a unified, scalable search space.
result Efficiently searches over complete architectures, outperforming existing methods.
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.
This work recommends personalized search stories to users based on their interests.
problem Personalized search story recommendation within search engines.
method Deep reinforcement learning architecture trained by imitation learning and reinforcement learning.
result Empirically demonstrated effectiveness on real-world data sets.
A method to reduce memory usage in NAS by pruning the search space.
problem High GPU memory consumption in One-Shot NAS techniques.
method Utilising Zero-Shot NAS to prune the search space before applying One-Shot NAS.
result Reduces memory consumption by 81% while maintaining accuracy.
Paper uses CMAB to improve NAS efficiency and accuracy.
problem Improving efficiency and accuracy of NAS for DNNs.
method Formulated NAS as CMAB, used Nested Monte-Carlo Search.
result Discovered cell structure achieves comparable accuracy to state-of-the-art, 20x faster.
New agent learns from previous search spaces to improve NAS efficiency.
problem NAS requires restarting learning from scratch between different search spaces.
method Transformer-based agent for joint training and knowledge transfer.
result Efficient knowledge transfer between search spaces improves NAS performance.
PGS uses neural networks to improve policies online without search trees.
problem Limited scalability of Monte Carlo Tree Search (MCTS) for high branching factor games.
method Adapts a neural network simulation policy via policy gradient updates, avoiding search trees.
result PGS achieves comparable performance to MCTS and defeats strong Hex agents.
New method reduces NAS search time and complexity.
problem High computational cost and complexity in NAS.
method Differentiable search space with annealing and pruning.
result Achieves 1.68% error on CIFAR-10 with 0.2 GPU days.
Approaches to learning Bayesian networks from data typically combine a scoring function with a heuristic search procedure. Given a Bayesian network structure, many of the scoring functions derived in the literature return a score for the entire equivalence class to which the structure belongs. When using such a scoring…
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.
This work proposes searching for optimal operation distribution in neural architecture search.
problem Finding optimal neural architecture with specific operations and connections.
method Search for the optimal operation distribution, providing a stochastic and approximate solution.
result Operation distribution holds enough discriminating power to reliably identify a solution and is easier to optimise than traditional encodings.
CrossBeam learns to search more efficiently in program synthesis.
problem Efficiently searching through vast program spaces.
method Trains a neural model to guide program synthesis, combining previously explored programs.
result CrossBeam explores much smaller portions of the program space compared to state-of-the-art methods.
Deep-n-Cheap automates deep learning model search for low complexity.
problem Finding efficient deep learning models for various datasets.
method Automated search framework for architecture and hyperparameters, including search transfer.
result Models offer comparable performance to state-of-the-art but are faster to train.
Paper presents a new trie for integer sketches to improve similarity searches.
problem Efficient similarity searches on integer sketches.
method Introduces a novel b-bit sketch trie that leverages succinct data structures. result Significantly improves search time and space-efficiency of similarity searches.
Improves diffusion model performance and efficiency through classical search.
problem Tackles inference-time control in diffusion models.
method Proposes a framework combining local and global search for efficient navigation.
result Significant gains in performance and efficiency across various domains.
Paper proposes a new evaluation method for NAS search phase.
problem NAS search phase effectiveness not well evaluated.
method Compare NAS solutions with random selection; evaluate weight sharing strategy.
result State-of-the-art NAS algorithms perform similarly to random selection.
Graph-based NAS improves sample efficiency in architecture design.
problem Current NAS search spaces are static sequences, limiting expressiveness.
method Proposed graph-based search space with vertices and edges for iterative and branching decisions.
result Graph representation improves sample efficiency in architecture design.
Random search outperforms leading NAS methods in neural architecture search.
problem Improving the reproducibility and efficiency of neural architecture search.
method Proposed random search with early-stopping and weight-sharing as NAS baselines.
result Random search with weight-sharing achieves state-of-the-art results on PTB and highly competitive results on CIFAR-10.
einspace expands NAS search space to include diverse neural architectures.
problem NAS results are often limited to existing structures; new designs are rare.
method einspace uses a probabilistic context-free grammar to create a versatile search space.
result einspace discovers novel and improved architectures, including convolutions and attention.
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.
We consider a framework for structured prediction based on search in the space of complete structured outputs. Given a structured input, an output is produced by running a time-bounded search procedure guided by a learned cost function, and then returning the least cost output uncovered during the search. This framewor…
Method predicts disease outbreaks using search logs, overcoming instability.
problem Predicting disease outbreaks from search logs is challenging due to short-term and long-term instability.
method Seasonal-adjustment method decomposes logs into seasonal, trend, and irregular components; feature selection method selects relevant search terms.
result Proposed method outperforms comparative methods in prediction accuracy for seven of ten diseases.
SGAS improves neural architecture search by choosing and pruning operations greedily.
problem NAS often fails to generalize in final evaluation.
method Divides search into sub-problems and chooses/prunes candidate operations greedily.
result SGAS finds state-of-the-art architectures with minimal computational cost.
UNAS combines DNAS and RL for efficient architecture search.
problem Discovering high accuracy or low latency neural architectures.
method Unified framework combining differentiable and reinforcement learning approaches.
result UNAS achieves state-of-the-art accuracy on CIFAR-10, CIFAR-100, and ImageNet datasets.
Efficient neural architecture search by sampling structure and operations.
problem Efficiently searching for optimal neural architectures.
method Decouples structure and operation search, using reinforcement learning with policy vectors.
result Significantly improved efficiency compared to traditional methods.
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.
SNAS efficiently searches neural architectures using stochastic optimization.
problem Efficiently searching for optimal neural architectures.
method SNAS trains parameters of both neural operations and architecture distribution in a single round of backpropagation, using a novel search gradient and locally decomposable rewards.
result SNAS achieves state-of-the-art accuracy with fewer training epochs compared to other NAS methods.
Paper addresses bias in search intent affecting click behavior.
problem Bias in user search intent affects click behavior and relevance.
method Proposes a search intent bias hypothesis to improve click models.
result Click models can better interpret user clicks and improve retrieval performance.
Paper tackles NAS problem by modeling it as a sparse supernet.
problem Neural Architecture Search (NAS) problem, particularly Mixed-Path Search.
method Model NAS as a sparse supernet with sparsity constraints. Use hierarchical accelerated proximal gradient algorithm for optimization.
result Proposed method finds compact, general, and powerful neural architectures.
Bonsai-Net efficiently discovers state-of-the-art models with fewer parameters.
problem Efficiently discovering state-of-the-art neural architectures with minimal computational expense.
method Bonsai-Net uses a modified differential pruner to explore a relaxed search space.
result Bonsai-Net consistently discovers better architectures than random search with fewer parameters.
New method speeds up k-means clustering for large k by improving nearest-neighbor search.
problem Efficiently clustering large datasets with high-dimensional points.
method Seeded Approximate Nearest-Neighbor Search methods to improve Lloyd's algorithm.
result Significantly faster k-means clustering for large k values.
TGLS generates text by optimizing search results and learning from them.
problem Unsupervised text generation without explicit training data.
method TGLS uses simulated annealing to estimate sentence quality, then a conditional generative model learns from search results.
result TGLS outperforms unsupervised baselines and matches state-of-the-art supervised methods in paraphrase generation.
The study finds that Chinese internet users have different search behaviors and attention patterns.
problem Heterogeneity in search behavior and attention among Chinese internet users.
method Data extraction technology to analyze Baidu Index keyword search volume data.
result Chinese internet users exhibit different search behaviors and attention patterns.
Contrastive embeddings improve neural architecture search performance.
problem Improving performance of neural architecture search algorithms.
method Contrastive learning to identify networks based on data Jacobians and produce embeddings.
result Traditional black-box optimization algorithms can reach state-of-the-art performance with contrastive embeddings.