Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

2875748601,147 · Jun 202019922001200920172026
48 results for state-of-the-art performance

Global constraints and reranking have not been used in cognates detection research to date. We propose methods for using global constraints by performing rescoring of the score matrices produced by state of the art cognates detection systems. Using global constraints to perform rescoring is complementary to state of th…

2017-04-24abs ↗pdf ↗

The paper evaluates and benchmarks electricity price forecasting models.

problem Lack of rigorous evaluation methods and open datasets.
method Literature review, cross-market comparison, open datasets, and python toolbox.
result Best practices for electricity price forecasting are proposed.

Deep neural networks have revolutionized many fields such as computer vision and natural language processing. Inspired by this recent success, deep learning started to show promising results for Time Series Classification (TSC). However, neural networks are still behind the state-of-the-art TSC algorithms, that are cur…

2019-03-15abs ↗pdf ↗

Bonsai-Net efficiently discovers state-of-the-art models with fewer parameters.

problem Efficiently discovering state-of-the-art neural architectures with minimal computational expense.
method Bonsai-Net uses a modified differential pruner to explore a relaxed search space.
result Bonsai-Net consistently discovers better architectures than random search with fewer parameters.

Hyperboost uses gradient boosting for hyperparameter optimization, outperforming state-of-the-art methods.

problem Hyperparameter tuning for machine learning algorithms
method Gradient boosting surrogate model with quantile regression and distance metric
result Hyperboost outperforms state-of-the-art techniques in empirical tests

Study shows low-complexity models can perform as well as state-of-the-art on small datasets.

problem Performance of deep learning models on small datasets.
method Wide variety of experiments with different deep learning architectures on small datasets.
result Low-complexity models can perform comparably well or better than state-of-the-art models on small datasets.

New MTPP model offers interpretable predictions with state-of-the-art performance.

problem Inexpressive models lack interpretability, while neural models sacrifice interpretability for performance.
method Extends Hawkes process to a hypernetwork with a latent space, making it flexible and interpretable.
result Achieves state-of-the-art performance across various tasks and metrics.

Deep neural network models have recently achieved state-of-the-art performance gains in a variety of natural language processing (NLP) tasks (Young, Hazarika, Poria, & Cambria, 2017). However, these gains rely on the availability of large amounts of annotated examples, without which state-of-the-art performance is rare…

2018-11-13abs ↗pdf ↗

Deep generative models parameterized by neural networks have recently achieved state-of-the-art performance in unsupervised and semi-supervised learning. We extend deep generative models with auxiliary variables which improves the variational approximation. The auxiliary variables leave the generative model unchanged b…

2016-02-17abs ↗pdf ↗

Residual networks (ResNets) have recently achieved state-of-the-art on challenging computer vision tasks. We introduce Resnet in Resnet (RiR): a deep dual-stream architecture that generalizes ResNets and standard CNNs and is easily implemented with no computational overhead. RiR consistently improves performance over R…

2016-03-25abs ↗pdf ↗

Generative adversarial networks are a class of generative algorithms that have been widely used to produce state-of-the-art samples. In this paper, we investigate GAN to perform anomaly detection on time series dataset. In order to achieve this goal, a bibliography is made focusing on theoretical properties of GAN and …

2018-12-06abs ↗pdf ↗

Noise-ignorant empirical risk minimization achieves state-of-the-art performance on noisy data.

problem Learning with noisy labels in multi-class classification problems.
method Introducing relative signal strength (RSS) to quantify transferability and applying Noise Ignorant Empirical Risk Minimization (NI-ERM).
result NI-ERM achieves state-of-the-art performance on CIFAR-N data challenge.

Fully convolutional neural networks (FCN) have been shown to achieve state-of-the-art performance on the task of classifying time series sequences. We propose the augmentation of fully convolutional networks with long short term memory recurrent neural network (LSTM RNN) sub-modules for time series classification. Our …

2017-09-08abs ↗pdf ↗

We propose a novel accelerated exact k-means algorithm, which performs better than the current state-of-the-art low-dimensional algorithm in 18 of 22 experiments, running up to 3 times faster. We also propose a general improvement of existing state-of-the-art accelerated exact k-means algorithms through better estimate…

2016-02-08abs ↗pdf ↗

GeoStat simplifies time series classification with fast, intuitive features.

problem Efficiently classify time series data without high computational costs.
method GeoStat representations based on differential geometric statistics.
result Simple KNN and SVM classifiers achieve state-of-the-art performance.

Graph Neural Networks (GNNs) have proven to be successful in many classification tasks, outperforming previous state-of-the-art methods in terms of accuracy. However, accuracy alone is not enough for high-stakes decision making. Decision makers want to know the likelihood that a specific GNN prediction is correct. For …

2019-05-07abs ↗pdf ↗

Batch normalization has become ubiquitous in many state-of-the-art nets. It accelerates training and yields good performance results. However, there are various other alternatives to normalization, e.g. orthonormalization. The objective of this paper is to explore the possible alternatives to channel normalization with…

2018-12-07abs ↗pdf ↗

Unified kernel-based methods improve nonlinear causal discovery.

problem Identifying nonlinear causal relationships between time series variables.
method Unified Kernel Principal Component Regression (KPCR) and Gaussian Process score-based model with Smooth Information Criterion.
result Improved performance in time series nonlinear causal discovery.

Rank-based metrics are some of the most widely used criteria for performance evaluation of computer vision models. Despite years of effort, direct optimization for these metrics remains a challenge due to their non-differentiable and non-decomposable nature. We present an efficient, theoretically sound, and general met…

2019-12-07abs ↗pdf ↗

Image captioning models are usually evaluated on their ability to describe a held-out set of images, not on their ability to generalize to unseen concepts. We study the problem of compositional generalization, which measures how well a model composes unseen combinations of concepts when describing images. State-of-the-…

2019-09-10abs ↗pdf ↗

In order to achieve state-of-the-art performance, modern machine learning techniques require careful data pre-processing and hyperparameter tuning. Moreover, given the ever increasing number of machine learning models being developed, model selection is becoming increasingly important. Automating the selection and tuni…

2017-05-15abs ↗pdf ↗

BAxUS optimizes high-dimensional functions adaptively, avoiding performance degradation and failure.

problem State-of-the-art HDBO methods degrade or fail with increasing dimensions.
method BAxUS uses nested random subspaces to adaptively optimize high-dimensional functions.
result BAxUS outperforms state-of-the-art methods across various applications.

The study assesses ML model robustness under worst-case subpopulations.

problem ML model performance degradation under non-training population.
method Two-stage estimation procedure for evaluating worst-case robustness over subpopulations.
result The method certifies model robustness and prevents unreliable deployments.

We propose a novel adaptive empirical Bayesian method for sparse deep learning, where the sparsity is ensured via a class of self-adaptive spike-and-slab priors. The proposed method works by alternatively sampling from an adaptive hierarchical posterior distribution using stochastic gradient Markov Chain Monte Carlo (M…

2019-10-23abs ↗pdf ↗

Soft Truncation improves diffusion model performance by balancing loss scales across diffusion times.

problem Inverse correlation between density estimation and sample generation in diffusion models.
method Introduces Soft Truncation, a training technique that softens the truncation hyperparameter.
result Soft Truncation achieves state-of-the-art performance on various datasets.

Normalizing flows and autoregressive models have been successfully combined to produce state-of-the-art results in density estimation, via Masked Autoregressive Flows (MAF), and to accelerate state-of-the-art WaveNet-based speech synthesis to 20x faster than real-time, via Inverse Autoregressive Flows (IAF). We unify a…

2018-04-03abs ↗pdf ↗

Simple GBRT model improved by window-based input transformation outperforms state-of-the-art deep learning models.

problem Improving performance of traditional forecasting models for time series data.
method Transformed GBRT model input structure to include target values and external features, forming one input instance per training window.
result Simple GBRT model with window-based input transformation outperformed state-of-the-art deep learning models on nine datasets.

Most deep learning classification studies assume clean data. However, when dealing with the real world data, we encounter three problems such as 1) missing data, 2) class imbalance, and 3) missing label problems. These problems undermine the performance of a classifier. Various preprocessing techniques have been propos…

2019-02-26abs ↗pdf ↗

The concepts of unitary evolution matrices and associative memory have boosted the field of Recurrent Neural Networks (RNN) to state-of-the-art performance in a variety of sequential tasks. However, RNN still have a limited capacity to manipulate long-term memory. To bypass this weakness the most successful application…

2017-10-26abs ↗pdf ↗

Supervised deep learning has gained significant attention for speech enhancement recently. The state-of-the-art deep learning methods perform the task by learning a ratio/binary mask that is applied to the mixture in the time-frequency domain to produce the clean speech. Despite the great performance in the single-chan…

2020-01-30abs ↗pdf ↗

We propose a simple discrete time semi-supervised graph embedding approach to link prediction in dynamic networks. The learned embedding reflects information from both the temporal and cross-sectional network structures, which is performed by defining the loss function as a weighted sum of the supervised loss from past…

2016-10-14abs ↗pdf ↗

New algorithm outperforms existing ones in multi-player bandit problems without sensing.

problem Decentralized multi-player multi-armed bandit problem without collision or sensing info.
method Randomized Selfish KL-UCB, inspired by Selfish KL-UCB, with low complexity.
result Randomized Selfish KL-UCB outperforms state-of-the-art algorithms in almost all environments.

Ansor generates high-performance tensor programs for deep learning.

problem Generating high-performance tensor programs for deep learning on various hardware platforms is challenging.
method Ansor uses a hierarchical representation of the search space, sampling programs, and evolutionary search with a learned cost model to find high-performance programs.
result Ansor improves deep neural network execution performance up to 3.8x on Intel CPU, 2.6x on ARM CPU, and 1.7x on NVIDIA GPU.