Predicts customer call intent for auto dealerships using CNN.
problem Understanding customer intent from phone calls for better service.
method Developed a CNN-based supervised learning model for multi-class classification.
result CNN model performs well on customer call intent classification.
Modelling all possible life cycles of a company in a highly competitive economic environment gives a significant advantage to the owner in his business investment activities. This article proposes and analyses a dynamic model of a company's life cycle with known action costs and transition probabilities, that can be af…
FLAME auto-labels mobile data efficiently on diverse processors.
problem Accurately and efficiently labeling mobile data with unknown labels on heterogeneous processors.
method Self-adaptive auto-labeling system Flame that schedules and executes workloads on mobile processors.
result Flame achieves high labeling accuracy and performance on heterogeneous mobile processors.
Auto-regressive models improve smoothing efficiency with exponentially tapered windows.
problem Improving time-series smoothing efficiency.
method An auto-regressive formulation for time-series smoothing.
result Auto-regressive models result in moving means with exponentially tapered windows.
Deep learning models detect and classify log anomalies.
problem Anomaly detection in unstructured log data.
method Auto-LSTM, Auto-BLSTM, and Auto-GRU models for feature extraction.
result Models outperform other algorithms on various log data sets.
The paper identifies saddlepoints in unsupervised auto-encoding neural nets.
problem The risk landscape of unsupervised least squares in auto-encoding neural nets.
method Established an equivalence between unsupervised least squares and principal manifolds, discussed regularization strategies for auto-encoders.
result All non-trivial critical points in auto-encoding are saddlepoints, which are degenerate in overcomplete auto-encoding.
Auto-Surprise automates recommender system selection and optimization.
problem Finding the best algorithm and hyperparameters for recommender systems.
method Extends Surprise library with TPE optimization for algorithm selection and hyperparameter tuning.
result Significantly faster in finding optimal hyperparameters compared to grid search.
Two graph auto-encoders decouple feature propagation from graph convolution layers.
problem Designing efficient graph auto-encoders with fixed receptive fields.
method L-GAE and L-VGAE using linear matrix computation before auto-encoder input.
result Comparable performance to VGAEs with smaller, simpler networks.
Proposes isotonic recalibration for insurance pricing to ensure auto-calibration under low signal-to-noise ratio.
problem Ensuring auto-calibration in insurance pricing models to prevent cross-financing.
method Applies isotonic recalibration to regression models to achieve auto-calibration.
result Isotonically recalibrated regression functions have low complexity under low signal-to-noise ratio.
Proof of Gaussian ML estimator consistency in linear auto-regressive models.
problem Consistency of Gaussian maximum likelihood estimator in linear auto-regressive models.
method Information-theoretic proof without stability assumptions.
result Nearly optimal non-asymptotic rates for parameter recovery.
Gini index needs auto-calibration for consistent decision-making.
problem Gini index's inconsistency in decision-making.
method Restrict Gini index to auto-calibrated regression models.
result Gini index becomes strictly consistent with auto-calibration.
Auto-ML framework tackles data drift using GBDT and incremental learning.
problem Data distribution changes over time, reducing model performance.
method GBDT and Incremental learning for handling data drift.
result Effective solution for data drift with robust performance.
New auto-encoder handles varying noise levels without retraining.
problem Auto-encoders degrade in noisy conditions.
method Formalized auto-encoders as transform learning, derived new architecture.
result Models generalize well to different noise levels.
New method improves auto-labeling accuracy by optimizing confidence functions.
problem Overconfident model scores lead to poor TBAL performance.
method Developed a new post-hoc method, Colander, to optimize TBAL confidence functions.
result Achieves up to 60% improvement in coverage over baseline methods.
CAFLOW uses auto-regressive flows to translate images efficiently.
problem Image-to-image translation tasks.
method Transforms conditioning image into latent encodings using normalizing flows, models conditional distribution with auto-regressive distributions.
result Outperforms former conditional flow designs.
DGA and DVGA learn disentangled graph representations to improve graph analysis.
problem Holistic graph auto-encoders fail to capture latent factors effectively.
method Design disentangled graph convolutional network and component-wise flow, impose independence constraints.
result Improved disentangled graph representations enhance graph analysis tasks.
Auto-PyTorch automates deep learning by optimizing neural architectures and hyperparameters.
problem Automated deep learning for tabular data with robust and efficient optimization.
method Combines multi-fidelity optimization, portfolio construction, and warmstarting with ensembling.
result Achieves state-of-the-art performance on tabular benchmarks.
A new triad decoder improves graph auto-encoders' performance.
problem Graph auto-encoders ignore edge interactions, leading to suboptimal predictions.
method Integrates triadic closure property to predict three edges in a local triad.
result Triad decoder leads to more accurate predictions, clustering, and graph characteristics preservation.
Auto-regressive models learn latent states from partially observed linear dynamical systems.
problem Understanding how auto-regressive models learn latent representations from partially observed linear dynamical systems.
method Empirical risk minimization on partially observed linear dynamical systems.
result Two-layer linear auto-regressive models learn to approximate Kalman filtering, coinciding with optimal state estimates.
Auto-sizing improves machine translation efficiency by 3.9 BLEU points with fewer parameters.
problem Optimizing neural network architecture and hyperparameters for low-resource machine translation is computationally expensive.
method Auto-sizing uses regularization to dynamically adjust network size during training.
result Auto-sizing improves BLEU scores by up to 3.9 points with one-third fewer parameters.
Recent work suggests that some auto-encoder variants do a good job of capturing the local manifold structure of the unknown data generating density. This paper contributes to the mathematical understanding of this phenomenon and helps define better justified sampling algorithms for deep learning based on auto-encoder v…
Auto-decoder synthesizes graphs from latent codes.
problem Creating new graph structures from specified distributions.
method Generative model learns latent codes from empirical distribution. Self-attention identifies likely connectivity patterns. Graph-based normalizing flows sample latent codes.
result Model outperforms state of the art by 1.5x in accuracy and 2x in speed.
What do auto-encoders learn about the underlying data generating distribution? Recent work suggests that some auto-encoder variants do a good job of capturing the local manifold structure of data. This paper clarifies some of these previous observations by showing that minimizing a particular form of regularized recons…
Fisher auto-encoders use Fisher divergence for more robust generative modeling.
problem Model uncertainty in generative models.
method Minimizing Fisher divergence between true and modeled joint distributions.
result Fisher auto-encoders can more accurately quantify model uncertainty.
We propose the Wasserstein Auto-Encoder (WAE)---a new algorithm for building a generative model of the data distribution. WAE minimizes a penalized form of the Wasserstein distance between the model distribution and the target distribution, which leads to a different regularizer than the one used by the Variational Aut…
Auto-sklearn 2.0 simplifies AutoML with meta-learning and meta-feature-free techniques.
problem Designing efficient machine learning pipelines for large datasets under time constraints.
method PoSH Auto-sklearn uses meta-learning and bandit strategy for budget allocation.
result Reduces relative error by up to a factor of 4.5 and improves performance in 10 minutes.
We empirically study the trading activity in the electronic on-book segment and in the dealership off-book segment of the London Stock Exchange, investigating separately the trading of active market members and of other market participants which are non-members. We find that (i) the volume distribution of off-book tran…
Auto-encoders are among the most popular neural network architecture for dimension reduction. They are composed of two parts: the encoder which maps the model distribution to a latent manifold and the decoder which maps the latent manifold to a reconstructed distribution. However, auto-encoders are known to provoke cha…
Auto insurers improve risk assessment using t-SNE.
problem Accurate risk estimation for auto insurance policyholders.
method Combining neural network with t-SNE for dimensionality reduction.
result Visual representation of risk as a 2D surface, revealing high vs low risk policyholders.
Generative source separation methods such as non-negative matrix factorization (NMF) or auto-encoders, rely on the assumption of an output probability density. Generative Adversarial Networks (GANs) can learn data distributions without needing a parametric assumption on the output density. We show on a speech source se…
Paper proposes a novel auto-encoder for latent density estimation.
problem Challenges of learning generative probabilistic models due to curse of dimensionality.
method Joint dimensionality reduction and non-parametric density estimation framework using a novel estimator.
result Proposed model achieves promising results on various datasets.
Auto-Associative models cover a large class of methods used in data analysis. In this paper, we describe the generals properties of these models when the projection component is linear and we propose and test an easy to implement Probabilistic Semi-Linear Auto- Associative model in a Gaussian setting. We show it is a g…
Develops a new non-adversarial framework for better generative models.
problem Inaccurate approximation of target distribution in latent space.
method Tessellated Wasserstein Auto-Encoders (TWAE) using centroidal Voronoi tessellation (CVT) to tessellate latent space.
result Significantly enhances generative performance in terms of FID compared to existing models.
Enhanced loss function boosts fraud detection in auto insurance claims.
problem Class imbalance in auto insurance fraud detection.
method Structured three-stage training framework integrating convex surrogate, non-convex intermediate, and standard focal loss.
result Improves minority-class F1-scores and AUC compared to baseline methods.
In this paper, we propose a novel structure for a cross-modal data association, which is inspired by the recent research on the associative learning structure of the brain. We formulate the cross-modal association in Bayesian inference framework realized by a deep neural network with multiple variational auto-encoders …
Principal components analysis (PCA) is the optimal linear auto-encoder of data, and it is often used to construct features. Enforcing sparsity on the principal components can promote better generalization, while improving the interpretability of the features. We study the problem of constructing optimal sparse linear a…
CasVAE outperforms supervised methods for star-galaxy classification.
problem Challenges in machine learning for astronomy data.
method Cascade Variational Auto-Encoder (CasVAE) for unsupervised star-galaxy classification.
result CasVAE outperforms baseline models in accuracy and stability.
Auto-encoding generative adversarial networks (GANs) combine the standard GAN algorithm, which discriminates between real and model-generated data, with a reconstruction loss given by an auto-encoder. Such models aim to prevent mode collapse in the learned generative model by ensuring that it is grounded in all the ava…
Auto.gov uses RL to automate DeFi governance, improving security and profitability.
problem Manual DeFi governance is prone to human bias and financial risks.
method Auto.gov employs a deep Q-network reinforcement learning strategy for semi-automated parameter adjustments. result Auto.gov outperforms traditional governance methods by at least 14% in terms of protocol profitability. SIG-VAE enhances VGAE for graph data modeling.
problem Limited flexibility in VGAE for graph data.
method Hierarchical variational framework with Bernoulli-Poisson link decoder.
result SIG-VAE outperforms state-of-the-art methods on graph tasks.
This paper learns state, dynamics, and filtering algorithms together for data assimilation.
problem Costly parameter tuning and inaccurate dynamics models hinder data assimilation algorithms.
method Auto-differentiable data assimilation framework that learns state, dynamics, and parameters via gradient-based optimization.
result Several data assimilation methods can be learned or tuned within this framework.
Auto-encoders have emerged as a successful framework for unsupervised learning. However, conventional auto-encoders are incapable of utilizing explicit relations in structured data. To take advantage of relations in graph-structured data, several graph auto-encoders have recently been proposed, but they neglect to reco…
Adaptive graph auto-encoder improves general data clustering.
problem Extending graph convolution networks to general clustering tasks.
method Adaptive graph construction based on generative perspective, novel decoder design.
result Model performs well in weighted graph scenarios.
We provide theoretical and empirical evidence that using tighter evidence lower bounds (ELBOs) can be detrimental to the process of learning an inference network by reducing the signal-to-noise ratio of the gradient estimator. Our results call into question common implicit assumptions that tighter ELBOs are better vari…
New PG methods tackle nonconvex optimization with auto-conditioned stepsizes.
problem Optimizing nonconvex functions over convex sets.
method Auto-conditioned projected gradient (AC-PG) methods and stochastic variants.
result Achieved optimal iteration complexity for finding approximate stationary points.
AutoML serves as the bridge between varying levels of expertise when designing machine learning systems and expedites the data science process. A wide range of techniques is taken to address this, however there does not exist an objective comparison of these techniques. We present a benchmark of current open source Aut…
A simple method reduces bias in LLM auto-evaluators by controlling output length.
problem Bias in LLM auto-annotators, particularly length bias.
method Simple regression analysis to control for length difference and other mediators.
result Improved robustness and increased correlation with human preferences.
CAE models learn complex manifold structures in data.
problem Flat latent spaces in auto-encoders fail to capture manifold structures.
method Proposes Chart Auto-Encoders (CAE) with a multi-chart latent space.
result CAE provides better data representation with manifold properties.