Study predicts blood glucose levels from infrequent measurements.
problem Predicting blood glucose levels from infrequent measurements.
method Proposed post-prediction methods to improve accuracy of machine learning models.
result Post-prediction methods marginally improve blood glucose prediction accuracy.
Proposes a conservative LR estimator for infrequent data near a frequency threshold.
problem Overestimation of likelihood ratios for infrequent data near a frequency threshold.
method Conservative likelihood ratio estimator for frequencies slightly above a threshold.
result Improves prediction accuracy in named entity context prediction.
GDGAN improves medical image accuracy for rare diseases.
problem Poor accuracy for infrequent medical image classes.
method Serial GANs for general and detailed labels.
result GDGAN outperformed existing methods in AUC.
The study measures systemic risk using common and tail dependence factors.
problem Measuring systemic risk accurately during economic downturns.
method Modeling systemic risk with a common factor for market-wide shocks and a tail dependence factor for extreme events.
result Measures including a tail dependence factor offer better forecasting of financial stress than measures based solely on a common factor.
AMAGOLD improves stochastic gradient MCMC by infrequent Metropolis-Hastings corrections.
problem Bias in stochastic gradient Hamiltonian Monte Carlo (SGHMC).
method AMAGOLD infrequently uses Metropolis-Hastings corrections to remove bias, with a fixed step size schedule.
result AMAGOLD converges to the target distribution with a fixed, rather than a diminishing, step size, and at most a constant factor slower convergence rate.
CORE optimizes molecules by copying or generating substructures, improving accuracy.
problem Inaccurate substructure prediction in molecule optimization.
method Copy & Refine (CORE) strategy combining scaffolding tree generation and adversarial training.
result Significant improvement in various molecule optimization metrics.
This paper introduces SRPR for robust phase retrieval with smoothed loss functions.
problem Robust phase retrieval from noisy quadratic measurements with corruptions.
method Smoothed robust phase retrieval (SRPR) using convolution-type smoothed loss functions.
result SRPR has no spurious local solutions and benign landscape under corruptions.
Lazy, perfectly informed investors trade infrequently due to costs.
problem The paradox of an omniscient yet lazy investor trading infrequently.
method Formalized the paradox using geometric and fractional Brownian motion models, derived closed-form profit functions, and proved existence and uniqueness of the optimal trading frequency.
result The optimal trading frequency can be interpreted through the fractal dimension of the price path.
A new distributed SGD algorithm reduces communication by infrequent global reduction.
problem Reducing communication in large-scale machine learning training.
method Hierarchical averaging stochastic gradient descent (Hier-AVG) with infrequent global reduction.
result Hier-AVG achieves comparable training speed with better test accuracy.
Generative data augmentation improves unsupervised anomaly detection.
problem Improving anomaly detection performance in unsupervised settings.
method Oversampling infrequent normal samples using adversarial autoencoder (AAE) to transform high-dimensional multimodal data into low-dimensional unimodal latent distributions.
result Consistent improvements in anomaly detection across various real-world datasets.
New algorithm reduces switching costs in multinomial logit bandit problems.
problem Minimizing switching costs in multinomial logit bandit problems.
method Proposed AT-DUCB and FH-DUCB algorithms with low assortment switching costs.
result AT-DUCB and FH-DUCB algorithms achieve almost optimal minimax regret with low switching costs.
We consider an investor facing a classical portfolio problem of optimal investment in a log-Brownian stock and a fixed-interest bond, but constrained to choose portfolio and consumption strategies that reduce a dynamic shortfall risk measure. For continuous- and discrete-time financial markets we investigate the loss i…
Paper introduces MJ distances for better anomaly detection in time series.
problem Anomaly detection in large collections of time series.
method Introduces semi-metric MJ distances for measuring structural breaks.
result MJ distances outperform existing metrics in detecting similarity and anomalies.
Study on predictable forward processes in trading without frequent evaluations.
problem Trading performance evaluation times not matching trading times.
method Solving a linear functional equation to construct predictable forward processes.
result Predictable forward processes are inherently myopic and optimal strategies do not use future information.
Adam outperforms gradient descent on language models due to handling heavy-tailed class imbalance.
problem Heavy-tailed class imbalance in language tasks.
method Comparing Adam and gradient descent on various architectures and data types, focusing on the impact of class imbalance.
result Class imbalance causes slow convergence for gradient descent, while Adam and sign-based methods are less affected.
Detects BGP routing anomalies using bursty announcement patterns.
problem Detecting disruptive routing updates in the Internet.
method Burstiness measure of inter-arrival times around disruptive update dates and times.
result High recall and better precision in detecting anomalous incidents.
Study improves dynamic PT fleet optimization under noisy demand predictions.
problem Accurately predicting dynamic public transport demand for effective fleet management.
method Experimental case study in Copenhagen, using linear programming to optimize fleets.
result Optimized fleet performance is mainly affected by noise distribution skew and large errors.
Distributed, controllable energy storage devices offer several benefits to electric power system operation. Three such benefits include reducing peak load, providing standby power, and enhancing power quality. These benefits, however, are only realized during peak load or during an outage, events that are infrequent. T…
We propose a new algorithm called Parle for parallel training of deep networks that converges 2-4x faster than a data-parallel implementation of SGD, while achieving significantly improved error rates that are nearly state-of-the-art on several benchmarks including CIFAR-10 and CIFAR-100, without introducing any additi…
The ability to track a moving vehicle is of crucial importance in numerous applications. The task has often been approached by the importance sampling technique of particle filters due to its ability to model non-linear and non-Gaussian dynamics, of which a vehicle travelling on a road network is a good example. Partic…
Many practical environments contain catastrophic states that an optimal agent would visit infrequently or never. Even on toy problems, Deep Reinforcement Learning (DRL) agents tend to periodically revisit these states upon forgetting their existence under a new policy. We introduce intrinsic fear (IF), a learned reward…
Economies grow by upgrading the type of products they produce and export. The technology, capital, institutions and skills needed to make such new products are more easily adapted from some products than others. We study the network of relatedness between products, or product space, finding that most upscale products a…
New Q-Learning algorithm reduces switching cost in MDPs.
problem Reducing adaptivity in real-world applications.
method Q-Learning with UCB2 exploration, quantified by local switching cost.
result Achieves sublinear regret with low switching cost.
Reinforcement learning (RL) agents performing complex tasks must be able to remember observations and actions across sizable time intervals. This is especially true during the initial learning stages, when exploratory behaviour can increase the delay between specific actions and their effects. Many new or popular appro…
This work presents a novel approach to train invertible linear layers by adding rank-one perturbations.
problem Training invertible linear layers during optimization with gradient-based methods is challenging.
method Train rank-one perturbations and add them to weight matrices infrequently, keeping track of inverses and determinants.
result Invertible linear layers improve mixing and mode separation in normalizing flows.
We propose a model in which dividend payments occur at regular, deterministic intervals in an otherwise continuous model. This contrasts traditional models where either the payment of continuous dividends is controlled or the dynamics are given by discrete time processes. Moreover, between two dividend payments, the st…
Stochastic gradient descent is the method of choice for large-scale machine learning problems, by virtue of its light complexity per iteration. However, it lags behind its non-stochastic counterparts with respect to the convergence rate, due to high variance introduced by the stochastic updates. The popular Stochastic …
Leveraged ETFs can outperform their targets in certain market conditions, contrary to the volatility drag hypothesis.
problem The long-term performance decay of leveraged ETFs due to volatility drag.
method Unified framework incorporating AR(1) and AR-GARCH models, continuous-time regime switching, and flexible rebalancing frequencies.
result Return dynamics, including return autocorrelation, volatility clustering, and regime persistence, determine LETF performance.
Paper improves RLS for sparse outlier detection in linear models.
problem Outliers contaminate linear regression models infrequently.
method Hierarchical-optimization recursive least squares with sparsity-inducing regularization.
result The method robustly estimates linear filters/systems with outliers.
Enhances medical code predictions for multi-morbidity patients using text classification.
problem Improving accuracy in predicting medical codes for patients with multiple illnesses.
method Used machine learning techniques, including multi-label medical text classification, to enhance predictions.
result High dimensional embeddings pre-trained on health data significantly improve multi-label classification performance.
Proposes MorphMine for unsupervised morpheme segmentation to improve word embeddings.
problem Lack of semantic information in word-level analysis for infrequent and out-of-vocabulary words.
method MorphMine applies a parsimony criterion to hierarchically segment words into the fewest number of morphemes.
result MorphMine segments words into human-verified morphemes and improves word embedding quality.
AdaComm optimizes SGD by dynamically adjusting communication frequency for faster convergence.
problem Achieving optimal error-runtime trade-off in distributed SGD.
method Adaptive communication strategy that starts with infrequent averaging to save delay and improve speed, then increases frequency.
result AdaComm reduces training time by 3x while maintaining the same final loss.
The paper explores a Multi-Objective RL approach for trading that generalizes reward functions.
problem Improving performance in single-asset trading through adaptive reward functions.
method Developed a Multi-Objective Deep Reinforcement Learning algorithm to generalize reward functions and discount factors.
result The Multi-Objective algorithm demonstrates increased predictive stability and better performance in sparse reward scenarios.
Improved volatility forecasts for U.S. stocks using social media and news data.
problem Challenges in forecasting equity market volatility due to infrequency and variability of macroeconomic announcements.
method Estimating public attention and sentiment towards scheduled macroeconomic variables using various data sources and machine learning.
result Significant improvement in volatility forecasts for U.S. stocks, up to 14.99% on average.
Interactive machine learning improves deep RL in Minecraft by giving action advice.
problem Training deep RL agents in high-aliasing environments like Minecraft is computationally expensive.
method Conducted experiments with two RL algorithms, Feedback Arbitration, and Newtonian Action Advice, to give action advice to human teachers.
result Action advice from human teachers can improve agent performance in high-aliasing environments.
Algorithm distinguishes light-tailed from non-light-tailed distributions.
problem Characterize the tail of a distribution using hazard rate.
method Careful bucketing scheme based on hazard rate.
result Polynomial number of samples required for success.
Federated Learning tackles limited user participation with a new risk-aware approach.
problem Limited availability of users in federated learning environments.
method Random Access Model (RAM) and Conditional Value-at-Risk (CVaR) to design a risk-aware federated learning algorithm.
result The proposed approach achieves significantly improved performance under various setups compared to standard federated learning.
In text mining, information retrieval, and machine learning, text documents are commonly represented through variants of sparse Bag of Words (sBoW) vectors (e.g. TF-IDF). Although simple and intuitive, sBoW style representations suffer from their inherent over-sparsity and fail to capture word-level synonymy and polyse…
Notwithstanding the popularity of conventional clustering algorithms such as K-means and probabilistic clustering, their clustering results are sensitive to the presence of outliers in the data. Even a few outliers can compromise the ability of these algorithms to identify meaningful hidden structures rendering their o…
Improved elimination strategies for adaptive bandit identification reduce sample complexity and computational burden.
problem Inefficient elimination strategies in bandit identification.
method Adaptive elimination methods that update sampling rules frequently and reduce problem size.
result Adaptive elimination methods achieve better sample complexity and computational efficiency.
A new model learns preferences incrementally without personal data.
problem Incremental session-based recommendation without personal data.
method Memory Augmented Neural model (MAN) that combines a neural recommender with a nonparametric memory.
result MAN consistently outperforms existing methods in incremental session-based recommendation.
A new deep model generates molecules by fragments, improving validity and uniqueness.
problem Generating valid and unique molecules using deep learning.
method Develops a language model for molecular fragments, using frequency-based masking.
result Significantly outperforms other language model-based competitors in molecule generation.
Study finds consumers are more price-sensitive before livestreams than after.
problem Understanding consumer demand during livestreaming lifecycle.
method Examined consumer demand for live events and recorded versions using data from a livestreaming platform.
result Demand is more price-sensitive before livestreams than after.
The paper tackles decision making problems with funnel structure in email marketing campaigns.
problem Decision making challenges in systems with funnel structure, where fewer observations are received from deeper layers.
method Formulated as a contextual bandit with funnel structure and developed a multi-task learning algorithm.
result Our algorithms offer significant improvement over previous methods in email marketing campaigns.
This paper investigates Shampoo's heuristics and decouples preconditioner updates.
problem Improving Shampoo's heuristics for training neural networks.
method Decomposing preconditioner updates, correcting eigenvalues, and adapting eigenbasis computation frequency.
result Principled techniques to remove Shampoo's heuristics and improve training algorithms.
Algorithm improves wildlife protection patrols.
problem Balancing exploration and exploitation in patrolling vast protected areas.
method Formulated as a stochastic multi-armed bandit problem, leveraging smoothness and decomposability.
result Algorithm LIZARD improves performance on real-world poaching data.
To address three important issues involved in latent variable models (LVMs), including capturing infrequent patterns, achieving small-sized but expressive models and alleviating overfitting, several studies have been devoted to "diversifying" LVMs, which aim at encouraging the components in LVMs to be diverse. Most exi…
Method trains sparse neural networks without sacrificing accuracy.
problem Training sparse neural networks limits model size.
method Updates sparse network topology during training.
result Requires fewer FLOPs to achieve accuracy.