Method uses Seq2Seq learning to automatically generate recovery commands for ICT systems.
problem Manual decision-making for recovery commands is time-consuming and error-prone.
method Seq2Seq neural network model trained on past logs and commands.
result The model can estimate accurate recovery commands from new failures.
Paper presents an efficient method for selecting machine learning algorithms and hyper-parameters.
problem Efficient selection of machine learning algorithms and hyper-parameters is challenging for large datasets.
method Progressive sampling-based Bayesian optimization
result Significantly reduces search time, classification error rate, and error rate variability.
D-Adaptation automatically sets optimal learning rates without manual tuning.
problem Optimizing learning rates for efficient convergence in machine learning.
method D-Adaptation, which asymptotically achieves optimal learning rates without back-tracking or additional evaluations.
result D-Adaptation automatically matches hand-tuned learning rates across diverse problems.
Develops a mathematical model for automatic differentiation in machine learning.
problem Current automatic differentiation lacks a simple mathematical model for machine learning.
method Articulates relationships between program differentiation and nonsmooth functions, provides a class of functions and nonsmooth calculus.
result Shows how nonsmooth calculus applies to stochastic approximation methods and evidence of artificial critical points.
New algorithm selects variables from large datasets.
problem Automatic selection of variables from large datasets.
method Uses Graphical Models and combines with OLS method.
result Outperforms LASSO method in forecasting models.
Automatic differentiation---the mechanical transformation of numeric computer programs to calculate derivatives efficiently and accurately---dates to the origin of the computer age. Reverse mode automatic differentiation both antedates and generalizes the method of backwards propagation of errors used in machine learni…
Paper combines Vibrato and automatic differentiation for efficient financial option sensitivities.
problem Efficient computation of high-order derivatives for financial option sensitivities.
method Combines Vibrato and automatic differentiation methods.
result Combined method is faster and more stable than standard finite difference methods.
AutoSGD automatically adjusts learning rates for SGD.
problem Inefficient manual learning rate selection for SGD.
method AutoSGD automatically adjusts learning rates based on iteration.
result Empirical results show strong performance across various optimization tasks.
Method automatically estimates fetal abdominal circumference from ultrasound images.
problem Challenges in accurately estimating fetal abdominal circumference from ultrasound images.
method Proposes a CNN-based approach that classifies ultrasound images and uses Hough transformation for measuring AC.
result CNN provides sufficient classification results for AC estimation with small training samples.
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.
SAFE automates feature engineering for industrial tasks efficiently and scalably.
problem Efficiency and scalability of automatic feature engineering methods for industrial tasks.
method SAFE (Scalable Automatic Feature Engineering) method, which provides excellent efficiency and scalability.
result SAFE method provides prominent efficiency and competitive effectiveness in industrial tasks.
This paper compares automatic metrics for re-speaking quality assessment.
problem Estimating the quality of re-speaking results is challenging.
method Comparing and adapting automatic evaluation metrics (BLEU, EBLEU, NIST, METEOR, etc.) to re-speaking quality.
result Automatic metrics are compared to human-derived NER metric for re-speaking quality.
LOSSGRAD automatically adjusts learning rates in neural networks.
problem Finding optimal learning rates in gradient descent.
method LOSSGRAD uses quadratic approximation to find locally optimal step-size.
result LOSSGRAD achieves comparable results to other methods while being insensitive to initial learning rate.
AutoGD automatically adjusts learning rates for gradient descent.
problem Optimizing learning rates for gradient descent methods.
method AutoGD automatically adjusts learning rates based on iteration.
result AutoGD can recover the optimal rate of GD for a broad class of functions.
We use AD to compute gradients for complex functionals in stochastic model calibration.
problem Computing gradients for functions involving expectations in stochastic models.
method Automatic Adjoint Differentiation and parallelization.
result Faster and easier to implement approaches for gradient computation.
A new method, InfoGuide, improves automatic clustering analysis.
problem Lack of automatic clustering analysis frameworks.
method Capturing traces of information gain between clustering retrievals.
result InfoGuide can enable more automatic clustering analysis.
Meta-SAC automatically tunes SAC's entropy temperature for better exploration.
problem Exploration-exploitation dilemma in reinforcement learning.
method Meta-SAC uses metagradient and a novel meta objective to automatically adjust SAC's entropy temperature.
result Meta-SAC outperforms SAC-v2 by 10% on the humanoid-v2 task.
Automatically tunes learning rate and momentum for SGD methods.
problem Manual hyperparameter tuning is costly and lacks theoretical justification.
method Uses statistics of gradient estimator to automatically adjust learning rate and momentum.
result Matches performance of best manual settings for CNN training.
A scalable method for automatic statistical modeling using Gaussian Processes.
problem Challenges in automating statistical modeling for large datasets.
method Proposes Scalable Kernel Composition (SKC) to extend Automatic Statistician to bigger data sets.
result Derives a tighter upper bound on the GP marginal likelihood for model selection.
Survey reviews machine learning for automatic movement generation.
problem Need for automatic movement animation in interactive media.
method Machine learning techniques and motion capture data.
result Discussion of research gaps and challenges for future work.
New method for automatically smoothing GAMs in large datasets.
problem Lack of reliable and fast methods for automatic smoothing in large datasets of GAMs.
method Empirical Bayes approach with an approximate expectation-maximization algorithm involving double Laplace approximation.
result The method achieves state-of-the-art accuracy and is faster than existing methods.
Procedure groups nonparametric regression curves automatically.
problem Determining groups of nonparametric regression curves when curves are numerous.
method Automatic selection of group number through testing procedure.
result Groups of nonparametric regression curves exist in tunnel geometry.
ABDA automatically analyzes data without expert supervision.
problem Automatic exploratory data analysis for mixed data types.
method Automatic Bayesian Density Analysis (ABDA) for missing value estimation, data type and likelihood discovery, anomaly detection, and dependency structure mining.
result ABDA provides accurate density estimation and is suitable for mixed data types.
A new method automatically and dynamically sets learning rates in deep learning.
problem Determining the appropriate learning rate in deep learning tasks is challenging and often subjective.
method Local Quadratic Approximation (LQA) to automatically and dynamically set learning rates.
result The proposed method leads to nearly optimal learning rates in a computationally efficient way.
Automatic segmentation of auditory ossicles from CT images using Ricci curvature.
problem Automatic diagnosis of ossicles' diseases from 3D CT images of the head.
method Proposes a completely automatic method that locates and segments ossicles without manual labels or templates, using Ricci curvature in an energy function.
result Performance of the proposed method using discrete Forman-Ricci curvature is superior to state-of-the-art methods.
Efficient method predicts coronary calcium scores in cardiac and chest CTs.
problem Quantifying coronary artery calcium for risk assessment.
method Two ConvNets for direct regression of calcium scores, with optional decision feedback.
result Predicted calcium scores are highly correlated with manual scores and provide insight into decision-making.
Paper uses weakly-supervised clustering to automatically create network protocol abstractions.
problem Manual definition of abstraction by domain experts is time-consuming.
method Weakly supervised clustering algorithm for automatic abstraction.
result The method successfully matches the reference abstraction with minimal labeled examples.
AutoInit automatically finds good neural network initialization.
problem Finding optimal neural network initialization is crucial but time-consuming.
method Uses Jacobian tuning to automatically adjust network hyperparameters.
result The method finds good initialization for various network architectures.
Paper proposes a new method to automatically select Gaussian kernel bandwidth for SVDD.
problem Selecting optimal Gaussian kernel bandwidth for SVDD is crucial but challenging.
method Automatic unsupervised method for selecting Gaussian kernel bandwidth.
result The selected bandwidth is competitive with existing methods and can be computed quickly.
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.
This paper proposes a method to automatically compress neural networks using Bayesian tensor decomposition.
problem Challenges in directly applying tensor compression in neural network training.
method Bayesian tensorized neural network with automatic rank selection.
result Produces significantly more compact neural networks (7.4x to 137x) directly from training.
This paper improves speech recognition models using deep neural networks.
problem Improving automatic speech recognition models.
method Deployment of residual, densely-connected, and highway networks into speech recognition.
result Significant improvements in speech recognition models.
Lap-VARD algorithm improves signal reconstruction in tomography.
problem Signal reconstruction in tomography with sparsity constraint.
method Laplacian prior and automatic relevance determination framework.
result Optimized Laplacian prior enhances balance between sparsity and accuracy.
The paper analyzes sports commentary to automatically recognize events and extract insights.
problem Automatically recognizing and categorizing major actions in sports events from commentary.
method Used multiple Natural Language Processing techniques for classification and sentiment analysis.
result Identified insights from analyzing live sport commentaries and classifying major actions.
New deep learning method validated across multiple sleep staging databases.
problem Improving automatic sleep scoring accuracy across different datasets.
method Ensemble of local models using deep learning for automatic sleep staging.
result Good general performance compared to human experts and state-of-the-art methods.
The paper compares inference methods for Bayesian nonnegative matrix factorisation.
problem Improving prediction accuracy and pattern discovery in nonnegative matrix factorisation.
method Compared non-probabilistic, Gibbs sampling, variational Bayesian, and maximum-a-posteriori approaches.
result Variational Bayesian inference is a new and efficient approach for Bayesian nonnegative models.
The paper makes inference methods available for Gaussian models with banded precision.
problem Efficient inference for Gaussian models with banded precision.
method Develops linear algebra operators for banded matrices within automatic differentiation frameworks.
result The operators enable efficient variational inference and gradient-based sampling for Gaussian models with banded precision.
This paper introduces a spline-based method for nonparametric ADVI that handles complex posterior distributions.
problem Learning complex posterior distributions with skewness, multimodality, and bounded support.
method Develops a spline-based nonparametric approximation approach for ADVI.
result Establishes the asymptotic consistency of the derived lower bound for importance weighted autoencoder.
A new method uses PSO to optimize sentence weights for user-oriented document summaries.
problem Handling information overload in documents through efficient summarization.
method Particle Swarm Optimization (PSO) to identify and weight sentence features.
result Improved accuracy in summarization compared to previous methods.
SALSA automatically adjusts learning rates in stochastic gradient methods.
problem Automatic adjustment of learning rates in stochastic gradient methods.
method SALSA uses a line-search procedure to gradually increase the learning rate, then a statistical test to decrease it.
result SALSA matches the performance of best hand-tuned learning rate schedules in deep learning tasks.
A new method for stochastic optimization using virtual gradients.
problem Stochastic optimization challenges in computational efficiency and memory usage.
method Inspired by dynamic programming, SVGD uses a computational graph and automatic differentiation for efficient optimization.
result Experimental results show SVGD outperforms other methods on multiple datasets and network models.
A new method for automatically aligning and clustering time series data.
problem Challenges in aligning and clustering time series data, especially without a template signal.
method TROUT (Temporal Registration using Optimal Unitary Transformations) method based on a novel dissimilarity measure.
result TROUT outperforms competitors in clustering time series data.
A new method helps novices automatically set AutoDock's hyperparameters.
problem Helping novice users set optimal AutoDock hyperparameters.
method Surrogate based multi-objective algorithm using radial basis function model and non-dominated sorting.
result The method effectively helps novices set AutoDock hyperparameters.
Bayesian optimization tackles unknown search spaces with automatic expansion.
problem Bayesian optimization in unknown search spaces is challenging.
method Proposes a systematic volume expansion strategy to find points close to the objective function maximum without specifying parameters.
result Derives analytic expressions for expansion triggers and sizes, achieving epsilon-accuracy after a finite number of iterations.
Super-efficient automatic differentiation outperforms analytic methods in min-min optimization.
problem Optimizing functions defined as a minimum using iterative algorithms.
method Comparing automatic differentiation to analytic gradient estimation methods.
result Automatic differentiation yields an asymptotic error close to the square of the optimization error, demonstrating super-efficiency.
A method makes particle filters differentiable without altering their forward pass.
problem Compatibility issues between particle filters and automatic differentiation.
method Introduces a correction to particle weights using the stop-gradient operator.
result Automatic differentiation produces good estimators for gradients and second-order derivatives.
Deep transfer learning improves automatic sleep staging accuracy.
problem Small cohort data variability and inefficiency in sleep studies.
method Deep transfer learning approach using a large dataset to a small cohort.
result Significant performance improvement on automatic sleep staging.
Automatically discovers SMDP models in DQN representations for better reinforcement learning visualization.
problem Lack of tools to analyze and visualize the temporal abstractions learned by DRL agents.
method Develops a novel method to automatically discover an internal SMDP model in DQN representations and visualizes it using a directed graph above a t-SNE map.
result Shows evidence of hierarchical state aggregation learned by DQNs.