SOOTT framework optimizes target tracking with robust and learning-augmented algorithms.
problem Optimizing target tracking in dynamic environments with adversarial perturbations.
method Integrates robust and learning-augmented algorithms for online decision-making.
result CoRT learning-augmented algorithm strictly improves over robust BEST when predictions are accurate.
New algorithms improve privacy-preserving data release using external predictions.
problem Privacy-preserving data release with improved utility using external information.
method Learning-augmented algorithms for multiple quantile release.
result Error guarantees scale with prediction quality, almost recovering state-of-the-art guarantees.
Method improves simulation accuracy by mitigating distribution shift in hybrid systems.
problem Mitigating distribution shift in machine-learning augmented hybrid simulation.
method Tangent-space regularized estimator to control distribution shift.
result Marked improvements in simulation accuracy, especially for systems with high distribution shift.
Proposes a new framework for learning image augmentations to improve classification performance.
problem Improving classification performance with a given class of predictors.
method Transformed Risk Minimization (TRM) framework that optimizes both predictive models and data transformations.
result Performance of TRM with SCALE algorithm compares favorably to prior methods on CIFAR10/100.
Investment decisions can benefit from incorporating an accumulated knowledge of the past to drive future decision making. We introduce Continual Learning Augmentation (CLA) which is based on an explicit memory structure and a feed forward neural network (FFNN) base model and used to drive long term financial investment…
Enhances CMS with Bayesian nonparametrics for better low-frequency token estimation.
problem Improving frequency estimation of low-frequency tokens in data streams.
method Integrates Bayesian nonparametrics (Pitman-Yor process) into CMS for more accurate frequency estimation.
result CMS-PYP outperforms CMS and CMS-DP in estimating low-frequency tokens.
Exact learning improves naive Bayes classifier performance for small samples.
problem Improving naive Bayes classifier performance with small sample sizes.
method Proposes an exact learning augmented naive Bayes classifier (ANB) that ensures a class variable with no parents.
result The proposed ANB method outperforms other methods in comparison experiments.
HGNN learns augmented features for deep multi-task learning.
problem Feature learning for deep multi-task learning.
method Hierarchical Graph Neural Network (HGNN) with two levels of graph neural networks.
result Significant performance improvement in classification tasks.
Generative Adversarial Networks (GAN) have shown promising results on a wide variety of complex tasks. Recent experiments show adversarial training provides useful gradients to the generator that helps attain better performance. In this paper, we intend to theoretically analyze whether supervised learning with adversar…
A method to prevent image representation collapse through data-dependent augmentation.
problem Representation collapse due to image augmentations that damage information.
method Formalizing a stochastic encoding process with a tug-of-war between corruption and preserved information, using infoMax objective.
result Learning a data-dependent distribution of augmentations to avoid representation collapse.
Labeled data used for training activity recognition classifiers are usually limited in terms of size and diversity. Thus, the learned model may not generalize well when used in real-world use cases. Semi-supervised learning augments labeled examples with unlabeled examples, often resulting in improved performance. Howe…
Recursive KalmanNet combines neural networks with Kalman filters for precise state estimation.
problem State estimation in systems with noisy measurements and non-Gaussian noise.
method Recursive KalmanNet uses a recurrent neural network to estimate states with consistent error covariance, optimizing for Gaussian negative log-likelihood.
result Recursive KalmanNet outperforms conventional Kalman filters and deep learning-based estimators in non-Gaussian noise conditions.
New algorithm uses imperfect advice to improve online bipartite matching performance.
problem Online bipartite matching with imperfect advice.
method Designing an algorithm that uses external advice to improve performance between advice-free methods and optimal ratio.
result Algorithm achieves competitive ratio interpolating between advice-free methods and optimal ratio of 1.
Enhances weather detection by learning from auxiliary information.
problem Mispredictions in unsupervised severe weather detection.
method Learning joint representations of textual and weather data.
result Improved decision boundaries for severe weather detection.
A recurring problem faced when training neural networks is that there is typically not enough data to maximize the generalization capability of deep neural networks(DNN). There are many techniques to address this, including data augmentation, dropout, and transfer learning. In this paper, we introduce an additional met…
Enhances FDR control in variable selection using neural networks.
problem Balancing rigorous error control with statistical power in high-dimensional variable selection.
method Learning-augmented T-Rex Selector framework with a neural network trained on synthetic datasets.
result Achieves superior detection of true variables compared to existing approaches.
A challenge in training discriminative models like neural networks is obtaining enough labeled training data. Recent approaches use generative models to combine weak supervision sources, like user-defined heuristics or knowledge bases, to label training data. Prior work has explored learning accuracies for these source…
Message passing is the key to graph neural networks, but new terms are needed to avoid confusion.
problem Current methods of graph neural networks cannot solve all problems over given input graphs.
method Demonstrates that any function of interest can be expressed using pairwise message passing over a modified graph.
result Message passing is the fundamental approach for graph neural networks, and new terms are needed to avoid confusion.
Bayesian nonparametric CMS improves frequency estimation for power-law data.
problem Estimating frequencies of low-frequency tokens in power-law data streams.
method Developed a learning-augmented count-min sketch using a normalized inverse Gaussian process prior.
result The approach achieves remarkable performance in estimating low-frequency tokens.
Improved learning of multivariate Gaussians with imperfect advice.
problem Learning multivariate Gaussians with inaccurate advice.
method Developed learning algorithms for multivariate Gaussians using imperfect advice.
result Achieved better sample complexity for learning multivariate Gaussians with imperfect advice.
Aesthetics are critically important to market acceptance. In the automotive industry, an improved aesthetic design can boost sales by 30% or more. Firms invest heavily in designing and testing aesthetics. A single automotive "theme clinic" can cost over $100,000, and hundreds are conducted annually. We propose a model …
CCM improves context for Meta-RL by contrastive learning.
problem Improving context for Meta-RL to enable task generalization.
method CCM framework using contrastive learning for context encoding and information-gain-based trajectory collection.
result CCM outperforms state-of-the-art algorithms in benchmarks and sparse-reward environments.
Machine learning improves diagnostic test accuracy for bovine tuberculosis.
problem Improving diagnostic test sensitivity for bovine tuberculosis.
method Machine learning to assess risk landscapes and predict infection.
result Test sensitivity improved, detecting 240 more infected herds per year.
New insights into convergence of optimization methods for DAG structure learning.
problem Unclear convergence properties of optimization methods for structure learning.
method Examined the convergence of augmented Lagrangian method (ALM) and quadratic penalty method (QPM) for structure learning.
result Standard convergence result of ALM does not hold in various cases, and QPM is prone to ill-conditioning.
Enhances crypto-asset AMM with deep learning for better liquidity and efficiency.
problem Reduced slippage and improved liquidity in decentralized finance.
method Deep reinforcement learning for predicting market equilibrium and optimizing liquidity.
result Improved capital efficiency and reduced slippage for crypto-asset traders.
Data augmentation is an effective technique for improving the accuracy of modern image classifiers. However, current data augmentation implementations are manually designed. In this paper, we describe a simple procedure called AutoAugment to automatically search for improved data augmentation policies. In our implement…
Data augmentation (DA) has been widely utilized to improve generalization in training deep neural networks. Recently, human-designed data augmentation has been gradually replaced by automatically learned augmentation policy. Through finding the best policy in well-designed search space of data augmentation, AutoAugment…
SEMASIA provides a large dataset of latent representations for model comparison.
problem Difficulty in comparing semantic structures across different neural network models.
method Collection of latent representations from 1700 pretrained models across various benchmarks.
result Consistent semantic organization across models and datasets.
LSTMs promise much to financial time-series analysis, temporal and cross-sectional inference, but we find that they do not deliver in a real-world financial management task. We examine an alternative called Continual Learning (CL), a memory-augmented approach, which can provide transparent explanations, i.e. which memo…
Paper proposes an unbiased risk estimator for PLLAC, handling unseen classes.
problem Handling unseen classes in PLLAC where some classes are not present in the training set.
method Proposes an unbiased risk estimator that estimates the distribution of augmented classes by differentiating known classes from unlabeled data.
result The estimator provides theoretical guarantees and converges to true risk minimizer as data increases.
A new method improves label propagation for unsupervised domain adaptation.
problem Improving unsupervised domain adaptation through semi-supervised learning techniques.
method Label Propagation with Augmented Anchors (A2LP) for UDA. result A2LP improves over representative UDA methods and benchmarks. Neural model with parameterized algorithms improves graph CO problem solving.
problem Solving NP-hard graph combinatorial optimization problems efficiently and accurately.
method Combining neural models and parameterized algorithms to identify and handle hard and easy parts of CO instances.
result Framework produces superior solution quality and out-of-distribution generalization.
Proposes a gradient-based bilevel optimization method for efficient hyperparameter tuning.
problem Efficiently tuning hyperparameters in machine learning models.
method Gradient-based bilevel optimization approach.
result The proposed method is multiple times faster than existing techniques.
New methods use ML predictions to improve statistical inference.
problem Improving statistical inference using machine learning predictions.
method Prediction-Augmented Trees (PART, PAQ) for reliable statistical analysis.
result PART and PAQ outperform existing methods in various datasets.