Extends binary data classification for hierarchical data.
problem Efficiently classify data with hierarchical class labels.
method Extends a simple binary data classification approach to handle hierarchical relationships.
result Shows computational and accuracy advantages in certain settings.
Two new criteria help understand the advantage of deep neural networks.
problem Understanding the advantage of deepening neural networks.
method Proposed two new criteria to evaluate the expressivity of functions computable by deep neural networks.
result Increasing layers is more effective than increasing units in improving the expressivity of deep neural networks.
Paper studies binary random projections with controllable sparsity patterns for computational and accuracy advantages.
problem Improving computational efficiency and accuracy in random projections.
method Proposes two sparse binary projection models with controllable sparsity patterns.
result Significant computational advantages and improved accuracies in empirical evaluations.
Gradient descent benefits from tangent kernel advantages under specific conditions.
problem Comparing gradient descent with tangent kernel methods in learning.
method Analysis of gradient descent and tangent kernel methods under different conditions.
result Gradient descent can achieve small error only if tangent kernel methods have a non-trivial advantage, but this advantage can be very small.
DG improves policy gradients by weighting actions with a sigmoid of advantage and surprisal.
problem Pathologies in standard policy gradients, leading to poor updates and over-allocation of gradient budget.
method Introduces Delightful Policy Gradient (DG) that gates each term with a sigmoid of advantage and surprisal.
result DG provably improves directional accuracy in a single context and shifts the expected gradient closer to the oracle across multiple contexts.
Reduced modeling of a computationally demanding dynamical system aims at approximating its trajectories, while optimizing the trade-off between accuracy and computational complexity. In this work, we propose to achieve such an approximation by first embedding the trajectories in a reproducing kernel Hilbert space (RKHS…
New activation improves deep learning accuracy and robustness.
problem Improving accuracy and robustness of deep neural nets with limited data.
method Replaces softmax with graph Laplacian-based interpolating function.
result Significantly improves natural and robust accuracy.
This paper analyzes the impact of asynchronous updates on OVA models' accuracy.
problem The impact of asynchronous updates on the accuracy of OVA models.
method Defined a metric to quantify dataset differences, analyzed three factors (number of classes, data points, and training dataset divergence), and evaluated Spoken Language Understanding system.
result The proposed metric correlates strongly with model performances.
New method learns time-varying home field advantage in football.
problem Discovering causal factors behind home field advantage in sports.
method DYNAMO: a novel causal discovery method for non-stationary processes.
result Time-varying home field advantages influenced by referee bias.
Enhances FL with domain adaptation for better model accuracy.
problem Improving model accuracy in Federated Learning.
method Domain adaptation for per-user model improvement in Federated Learning.
result Domain adaptation improves model accuracy for all users, especially under differential privacy constraints.
This study improves quantum classifiers by optimizing data preprocessing.
problem Quantum Machine Learning advantages are not yet clearly demonstrated.
method Used Linear Discriminant Analysis (LDA) for data preprocessing.
result Variational Quantum Algorithm (VQA) outperforms classical classifiers.
VQAs use classical optimization to train quantum circuits, promising quantum advantage.
problem High computational cost of quantum simulations and solving large-scale problems.
method Variational Quantum Algorithms (VQAs) use classical optimizers to train parametrized quantum circuits.
result VQAs are a promising strategy for obtaining quantum advantage.
The paper classifies cervical cancer using various techniques and feature selection.
problem Classifying cervical cancer from a dataset with missing values and imbalance.
method Feature selection, over-sampling, under-sampling, dimensionality reduction, and classification techniques.
result Age, first sexual intercourse, number of pregnancies, smokes, hormonal contraceptives, and STDs: genital herpes are the main predictive features with high accuracy.
In this article, we advance divide-and-conquer strategies for solving the community detection problem in networks. We propose two algorithms which perform clustering on a number of small subgraphs and finally patches the results into a single clustering. The main advantage of these algorithms is that they bring down si…
We replace the output layer of deep neural nets, typically the softmax function, by a novel interpolating function. And we propose end-to-end training and testing algorithms for this new architecture. Compared to classical neural nets with softmax function as output activation, the surrogate with interpolating function…
A fast geometric regularizer improves event camera performance.
problem Event collapse in contrast maximization framework.
method Geometric regularizer to mitigate overfitting.
result State-of-the-art accuracy with reduced computational complexity.
RIGA watermarks DNNs covertly and robustly with minimal accuracy loss.
problem Watermarking deep neural networks to enable tracing after release.
method Robust white-box GAN watermarking using adversarial training.
result Significantly improves covertness and robustness over state-of-the-art.
This paper improves forest pruning to balance accuracy and interpretability.
problem Limited interpretability of regression forests.
method Lasso-pruning and theoretical analysis of regression forests.
result Pruned regression forests can achieve equal or better accuracy than unpruned ones, with significant size reduction.
New sampling scheme improves ML accuracy in physics simulations.
problem Improving accuracy of ML models in physics simulations.
method Taylor-based data sampling scheme for DNNs.
result Reduces error in DNN solutions of ODE systems.
MOBA-Slice evaluates team advantage in MOBA games using neural networks.
problem Difficulty in evaluating and predicting MOBA game outcomes.
method Time slice based evaluation framework using neural networks.
result MOBA-Slice outperforms existing methods in predicting game results and remaining time.
Although information extraction and coreference resolution appear together in many applications, most current systems perform them as ndependent steps. This paper describes an approach to integrated inference for extraction and coreference based on conditionally-trained undirected graphical models. We discuss the advan…
Estimation of facial expressions, as spatio-temporal processes, can take advantage of kernel methods if one considers facial landmark positions and their motion in 3D space. We applied support vector classification with kernels derived from dynamic time-warping similarity measures. We achieved over 99% accuracy - measu…
Boosting improves accuracy with fewer calls to weak learners for certain concept classes.
problem Improving accuracy of learning algorithms with limited weak learner calls.
method Combines boosting and list-decodable codes to achieve better performance for specific concept classes.
result A new boosting algorithm that achieves strong learning with fewer calls to weak learners and additional samples.
We consider accurately answering smooth queries while preserving differential privacy. A query is said to be K-smooth if it is specified by a function defined on [−1,1]d whose partial derivatives up to order K are all bounded. We develop an ε-differentially private mechanism for the class of K-smooth queries…
Bayesian Neural Networks improve accuracy and robustness.
problem Training and optimizing Bayesian Neural Networks (BNNs).
method Replace Kullback-Leibler divergence with Maximum Mean Discrepancy (MMD) in ELBO term.
result Higher accuracy on multiple benchmarks, including image classification tasks.
For the challenging task of modeling multivariate time series, we propose a new class of models that use dependent Matérn processes to capture the underlying structure of data, explain their interdependencies, and predict their unknown values. Although similar models have been proposed in the econometric, statistics, a…
Patch Gaussian augmentation improves model robustness without sacrificing accuracy.
problem Challenges in building robust models without sacrificing accuracy.
method Adds Gaussian noise to randomly selected patches in images.
result Achieves state-of-the-art performance on benchmarks while improving clean data accuracy.
Single tree outperforms random forest in testing accuracy.
problem The challenge of improving single decision tree performance.
method Gradient-based entire tree optimization framework, scaled sigmoid approximation, numerical stability algorithm, subtree polish strategy.
result Optimized single tree outperforms classic random forest by 2.03% on average.
Despite its simplicity, the naive Bayes classifier has surprised machine learning researchers by exhibiting good performance on a variety of learning problems. Encouraged by these results, researchers have looked to overcome naive Bayes primary weakness - attribute independence - and improve the performance of the algo…
Hierarchical probabilistic models, such as mixture models, are used for cluster analysis. These models have two types of variables: observable and latent. In cluster analysis, the latent variable is estimated, and it is expected that additional information will improve the accuracy of the estimation of the latent varia…
SliceOut speeds up deep learning training without sacrificing accuracy.
problem Frequent model re-training and large model training workloads in deep learning.
method SliceOut uses dropout-inspired scheme to drop contiguous sets of units at random, leveraging GPU memory layout.
result 10-40% speedups and memory reduction with minimal accuracy loss.
The present work shows the application of transfer learning for a pre-trained deep neural network (DNN), using a small image dataset (≈ 12,000) on a single workstation with enabled NVIDIA GPU card that takes up to 1 hour to complete the training task and archive an overall average accuracy of 94.7%. The DNN …
Hard thresholding remains efficient for DNN pruning, but smart pruning offers faster accuracy recovery.
problem Efficiently pruning deep neural networks while minimizing accuracy loss.
method Proposes a novel smart pruning algorithm based on difference of convex functions optimization.
result Smart pruning is often orders of magnitude faster than competing approaches while achieving low accuracy degradation.
Quantum algorithms improve VaR and CVaR estimation for financial derivatives.
problem Quantum advantage in financial risk analysis of derivatives.
method Two quantum algorithms: QSP and QSP-based approach.
result QSP-based approach requires fewer quantum resources for the same accuracy.
New language models improve essay scoring accuracy.
problem Improving essay scoring accuracy using AI.
method Used BERT and XLNet language models to compare with traditional methods.
result Achieved above human-level accuracy on AES dataset.
A new neural network using chi-square test for binary classification.
problem Improving binary classification accuracy.
method Backpropagation neural network with chi-square test redefined cost and error functions.
result Significantly improved classification accuracy compared to related approaches.
A method improves deep network accuracy with low precision quantization.
problem Maintaining high accuracy in low precision deep networks.
method Learned Step Size Quantization, improving quantizer configuration and gradient estimation.
result Achieves highest accuracy on ImageNet with 2-4 bit precision models.
Generating user interpretable multi-class predictions in data rich environments with many classes and explanatory covariates is a daunting task. We introduce Diagonal Orthant Latent Dirichlet Allocation (DOLDA), a supervised topic model for multi-class classification that can handle both many classes as well as many co…
SemiNAS reduces NAS cost by predicting accuracy of unlabeled architectures.
problem Costly evaluation of architectures limits NAS efficiency.
method SemiNAS uses unlabeled architectures to train an accuracy predictor.
result SemiNAS achieves comparable accuracy with less data.
Tree-based synthesis improves forecast accuracy in GDP and inflation.
problem Improving forecast accuracy in GDP and inflation.
method Developed a nonparametric synthesis function using regression trees.
result Tree-based synthesis leads to improved forecast accuracy.
A student classifier learns from feature visualizations of a teacher network to achieve high accuracy.
problem Machine learning-based sleep apnea detection with limited access to training data.
method Interpretation-based indirect knowledge transfer using activation maximization and synthetic datasets.
result The student classifier achieves 97.8% accuracy on MNIST and 86.1-89.5% on Apnea-ECG dataset.
In data science and machine learning, hierarchical parametric models, such as mixture models, are often used. They contain two kinds of variables: observable variables, which represent the parts of the data that can be directly measured, and latent variables, which represent the underlying processes that generate the d…
Sparsity helps reduce the computational complexity of deep neural networks by skipping zeros. Taking advantage of sparsity is listed as a high priority in next generation DNN accelerators such as TPU. The structure of sparsity, i.e., the granularity of pruning, affects the efficiency of hardware accelerator design as w…
KGRL uses reinforcement learning with knowledge graphs for better interactive recommendation.
problem Achieving responsiveness and accuracy in dynamic user-item interactions.
method KGRL combines reinforcement learning and knowledge graphs, using a local knowledge network and attention mechanism.
result KGRL outperforms state-of-the-art methods in simulated and real-world environments.
We show that the multi-class support vector machine (MSVM) proposed by Lee et. al. (2004), can be viewed as a MAP estimation procedure under an appropriate probabilistic interpretation of the classifier. We also show that this interpretation can be extended to a hierarchical Bayesian architecture and to a fully-Bayesia…
A new neural network model for sentiment analysis.
problem Accurate and transferable sentiment analysis models.
method A computationally-efficient feedforward neural network.
result Highly accurate models with low losses.
Automated radar data labeling using GNSS improves efficiency without sacrificing accuracy.
problem Manual annotation of automotive radar data is time-consuming and error-prone.
method The article introduces an automated system using GNSS to acquire data labels.
result The proposed method provides clear advantages in time savings with minimal data distortion.
The paper introduces a new bias measure, infra-marginality, to quantify unfairness in group fairness.
problem The trade-off between group fairness and individual-level bias in decision-making.
method Proposes a new notion of η-infra-marginality, proves its independence from accuracy, and provides practical methods to measure and avoid it. result High accuracy does not lead to high infra-marginality, but maximizing group fairness often increases infra-marginality.