NGE uses neural graphs to efficiently design robots.
problem Designing robots is hard due to combinatorial search space and evaluation costs.
method Formulated as graph search, NGE uses neural networks for policy parameterization and graph mutation with uncertainty.
result NGE significantly outperforms previous methods, discovering kinematically preferred structures.
Automates graph convolutional network design for semi-supervised node classification.
problem Designing optimal graph convolutional network architectures for semi-supervised node classification.
method An automatic process to define a problem-specific architecture based on graph structure.
result The proposed method outperforms existing methods in classification performance and network compactness.
Automates translating natural language to Verilog for digital design.
problem Manual translation of natural language specifications to Verilog is time-consuming and error-prone.
method Fine-tuned GPT-2 to derive Verilog from English, using a dataset of design tasks.
result GPT-2 achieved 94.8% correct translation across simple and abstract design tasks.
Automatically generates a deep RL curriculum for faster and more stable learning.
problem How to automatically generate a curriculum for deep RL agents.
method Interprets curriculum generation as an inference problem, learning task distributions progressively.
result Curricula significantly improve learning performance across various environments and deep RL algorithms.
Learn to automatically plug domain-specific modules into a common network.
problem Learning inflexibility and computational intensiveness in multi-domain learning.
method Neural Architecture Search (NAS) for data-driven adapter plugging and structure design.
result NAS-driven MDL model achieves comparable performance to existing approaches.
Convolutional neural networks (CNNs) are effective at solving difficult problems like visual recognition, speech recognition and natural language processing. However, performance gain comes at the cost of laborious trial-and-error in designing deeper CNN architectures. In this paper, a genetic programming (GP) framewor…
Automatically designs analog circuits with deep learning.
problem Manual design of analog circuits is time-consuming and error-prone.
method Two-stage network with hypernetwork scheme and differential simulator.
result The method generates efficient and accurate circuit designs.
Non-experts have long made important contributions to machine learning (ML) by contributing training data, and recent work has shown that non-experts can also help with feature engineering by suggesting novel predictive features. However, non-experts have only contributed features to prediction tasks already posed by e…
Machine learning predicts and generates appealing car designs.
problem Improving automotive aesthetics to boost sales.
method Combines VAE and GAN with supervised learning; trained on 203 SUVs and 180,000 images.
result Predicts aesthetic scores with 43.5% improvement over baseline; generates appealing designs.
Automates GNN design for molecular property prediction.
problem Designing and tuning GNN architectures for molecular property prediction is labor-intensive.
method Developed a NAS approach to automatically discover high-performing GNN architectures for MPNNs.
result Automatically discovered MPNNs outperform manually designed GNNs in molecular property prediction.
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.
Generative adversarial network system improves ECG arrhythmia classification.
problem Improving automatic ECG arrhythmia classification accuracy.
method Generative adversarial network with patient-specific normal beats and generated abnormal beats.
result Superior overall classification performance for SVEB and VEB on MIT-BIH arrhythmia database.
A new NAS framework optimizes 3D medical image segmentation architectures.
problem Optimizing neural architectures for high-resolution 3D medical images.
method Stochastic sampling algorithm for scalable gradient-based optimization of neural connectivities and operation types in both encoder and decoder.
result Automatically designed architecture outperforms human-designed U-Net.
Paper presents a Transformer model for automatic domain adaptation.
problem Challenges in selecting or designing domain adaptation algorithms.
method Transformer model approximates and selects domain adaptation algorithms.
result Transformers can approximate and automatically select domain adaptation algorithms.
In deep learning, performance is strongly affected by the choice of architecture and hyperparameters. While there has been extensive work on automatic hyperparameter optimization for simple spaces, complex spaces such as the space of deep architectures remain largely unexplored. As a result, the choice of architecture …
Deep neural network architectures have traditionally been designed and explored with human expertise in a long-lasting trial-and-error process. This process requires huge amount of time, expertise, and resources. To address this tedious problem, we propose a novel algorithm to optimally find hyperparameters of a deep n…
Music genre classification is an essential tool for music information retrieval systems and it has been finding critical applications in various media platforms. Two important problems of the automatic music genre classification are feature extraction and classifier design. This paper investigates inter-genre similarit…
MO-PaDGAN generates diverse, high-performance designs with multiple metrics.
problem Challenges in generating diverse, high-performance designs with multiple metrics.
method MO-PaDGAN uses a new Determinantal Point Processes based loss function for probabilistic modeling of diversity and performances.
result MO-PaDGAN expands the design space towards high-performance regions and generates new designs with high diversity and performances.
Automatic Chemical Design is a framework for generating novel molecules with optimized properties. The original scheme, featuring Bayesian optimization over the latent space of a variational autoencoder, suffers from the pathology that it tends to produce invalid molecular structures. First, we demonstrate empirically …
Bayesian optimization has been proposed as a practical and efficient tool through which to tune parameters in many difficult settings. Recently, such techniques have been combined with real-time fMRI to propose a novel framework which turns on its head the conventional functional neuroimaging approach. This closed-loop…
Automatically designs neural network structure using matrix conditioning.
problem Choosing an effective size and structure of neural networks for new datasets is time-consuming.
method Adjusts neuron proportions and scales network size using matrix conditioning.
result Small networks achieve high accuracy on various datasets.
Proposes an automatic cyclical scheduling for gradient-based discrete sampling.
problem Gradient-based sampling in high-dimensional models can get stuck in local modes.
method Cyclical step size and balancing schedules with automatic hyperparameter tuning.
result Proves non-asymptotic convergence and inference guarantees for general discrete distributions.
Efficient deep learning computing requires algorithm and hardware co-design to enable specialization: we usually need to change the algorithm to reduce memory footprint and improve energy efficiency. However, the extra degree of freedom from the algorithm makes the design space much larger: it's not only about designin…
We propose Efficient Neural Architecture Search (ENAS), a fast and inexpensive approach for automatic model design. In ENAS, a controller learns to discover neural network architectures by searching for an optimal subgraph within a large computational graph. The controller is trained with policy gradient to select a su…
A framework for faster, better infographic design by non-experts and experts alike.
problem Designing infographics is time-consuming and tedious for non-experts and even professionals.
method Semi-automated infographic framework for structured and flow-based designs, including automatic design ranking and customization options.
result Designers from all expertise levels can generate generic infographic designs faster than existing methods while maintaining quality.
Automated framework forecasts correlated time series in minutes.
problem Forecasting correlated time series with high accuracy and efficiency.
method Data-driven iterative pruning, zero-shot search, fast parameter adaptation.
result Framework achieves state-of-the-art accuracy and is faster than existing methods.
OGRe simplifies tensor calculations in general relativity.
problem Complex tensor calculations in general relativity.
method Object-oriented design for tensor calculus, automatic transformations, and optimized algorithms.
result Eliminates user errors and simplifies tensor calculations.
HM-NAS improves neural architecture search by learning optimal architectures.
problem Limited flexibility in architecture candidates due to hand-designed heuristics.
method Incorporates multi-level encoding and hierarchical masking to automatically learn optimal architectures.
result Achieves better architecture search performance and competitive model accuracy.
GP model for time series forecasting with priors.
problem Automatic selection of optimal kernels and reliable estimation of hyperparameters.
method Fixed composition of kernels, automatic relevance determination (ARD), empirical Bayes priors.
result GP model is more accurate than state-of-the-art models.
Many real-world objects are designed by smooth curves, especially in the domain of aerospace and ship, where aerodynamic shapes (e.g., airfoils) and hydrodynamic shapes (e.g., hulls) are designed. To facilitate the design process of those objects, we propose a deep learning based generative model that can synthesize sm…
Layout design with complex constraints is a challenging problem to solve due to the non-uniqueness of the solution and the difficulties in incorporating the constraints into the conventional optimization-based methods. In this paper, we propose a design method based on the recently developed machine learning technique,…
Survey tackles challenges in neural architecture design.
problem Challenges in designing optimal neural architectures.
method New classification perspective based on early NAS algorithms' characteristics, problems, and solutions.
result Comprehensive analysis and comparison of NAS works.
Deep learning system generates new Chinese fonts via style variables.
problem Efficiently design new Chinese fonts.
method End-to-end deep learning system generating new style fonts via interpolation of latent style-related embedding variables.
result Smooth transition between different font styles achieved.
VeLO learns versatile optimizers from deep learning tasks.
problem Training deep learning models with hand-designed optimizers.
method Meta-training a neural network optimizer on a wide variety of optimization tasks.
result The learned optimizer automatically adapts to different optimization tasks without hyperparameter tuning.
This work improves algorithm design for structured Pfaffian settings.
problem Designing algorithms for specific application domains with theoretical guarantees.
method Data-driven algorithm design using hyperparameter tuning and learning guarantees.
result Introduced the Pfaffian GJ framework for providing learning guarantees for Pfaffian function classes.
The benefits of automating design cycles for Bayesian inference-based algorithms are becoming increasingly recognized by the machine learning community. As a result, interest in probabilistic programming frameworks has much increased over the past few years. This paper explores a specific probabilistic programming para…
To relieve the pain of manually selecting machine learning algorithms and tuning hyperparameters, automated machine learning (AutoML) methods have been developed to automatically search for good models. Due to the huge model search space, it is impossible to try all models. Users tend to distrust automatic results and …
Multi-objective optimization is a crucial matter in computer systems design space exploration because real-world applications often rely on a trade-off between several objectives. Derivatives are usually not available or impractical to compute and the feasibility of an experiment can not always be determined in advance…
AdaNet is a lightweight TensorFlow-based (Abadi et al., 2015) framework for automatically learning high-quality ensembles with minimal expert intervention. Our framework is inspired by the AdaNet algorithm (Cortes et al., 2017) which learns the structure of a neural network as an ensemble of subnetworks. We designed it…
We investigate and compare the fundamental performance of several distributed learning methods that have been proposed recently. We do this in the context of a distributed version of the classical signal-in-Gaussian-white-noise model, which serves as a benchmark model for studying performance in this setting. The resul…
AutoGrow automatically discovers optimal depth in DNNs.
problem Designing optimal depth in deep neural networks is difficult and time-consuming.
method AutoGrow grows new layers in a seed architecture if it improves accuracy; stops if no improvement. Robust policies generalize to different architectures and datasets.
result AutoGrow discovers near-optimal depth on various datasets, improving accuracy-computation trade-off in ResNets.
Oriental ink painting, called Sumi-e, is one of the most appealing painting styles that has attracted artists around the world. Major challenges in computer-based Sumi-e simulation are to abstract complex scene information and draw smooth and natural brush strokes. To automatically find such strokes, we propose to mode…
Cascading flows improve variational inference in structured programs.
problem Challenges in variational inference for complex probabilistic programs.
method Integrates normalizing flows and ASVI to create cascading flows, which embed the forward-pass of probabilistic programs.
result Cascading flows outperform normalizing flows and ASVI in structured inference problems.
Automates design of lightweight neural networks for image classification.
problem Designing efficient neural networks for edge devices with limited computational resources.
method Uses the Mesh Adaptive Direct Search (MADS) algorithm to optimize network architecture.
result Achieves comparable performance to standard methods with fewer design trials.
AutoFIS automatically selects important feature interactions for CTR prediction models.
problem Manual feature interaction design is inefficient and prone to noise.
method Two-stage algorithm: search stage relaxes feature interactions to continuous parameters, re-train stage refines model performance.
result AutoFIS significantly improves CTR and CVR of FM-based models.
Algorithm design is a laborious process and often requires many iterations of ideation and validation. In this paper, we explore automating algorithm design and present a method to learn an optimization algorithm, which we believe to be the first method that can automatically discover a better algorithm. We approach th…
Functional tensors unify probabilistic programming with automatic differentiation.
problem Designing probabilistic programming systems that can handle diverse inference strategies.
method Introducing functional tensors that capture benefits of tensors and continuous probability distributions.
result Functional tensors enable parallel exact inference for various modeling motifs.
Paper uses GNNs to automatically detect botnets from network data.
problem Detecting botnets from network data using traditional methods is challenging.
method Synthesized botnet connections, tailored graph neural networks (GNNs), and deep learning.
result GNNs outperform traditional methods in botnet detection.