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,695 papers · 148 categories

Trend · papers per month

3016029031,204 · Jun 202019922001200920172026
48 results for flexible data collection

Adaptive inference for MM-estimators in bandit data with model misspecification.

problem Challenges in off-policy inference for adaptively collected bandit data with a misspecified model.
method A novel approach to define a projected solution over a stationary evaluation policy, stabilizing variance with flexible methods.
result Valid inference for MM-estimators in adaptive settings, even with unstable treatment policies.

Although there is a rich literature on methods for allowing the variance in a univariate regression model to vary with predictors, time and other factors, relatively little has been done in the multivariate case. Our focus is on developing a class of nonparametric covariance regression models, which allow an unknown p …

2011-01-11abs ↗pdf ↗

Combines BART and Gaussian process for spatial covariate prediction with uncertainty.

problem Improving spatial prediction models with nonlinear and interaction covariates.
method Bayesian Additive Regression Trees (BART) combined with Gaussian process for spatial dependence.
result Effective in reducing computational burden through INLA and MCMC.

A new clustering method uses nonparametric smoothing to estimate cluster membership functions.

problem Clustering with flexible, nonparametric estimation.
method Nonparametric smoothing to estimate cluster membership functions without explicit modelling assumptions.
result The method automatically determines the number of clusters and level of flexibility.

This paper presents a kernel-based discriminative learning framework on probability measures. Rather than relying on large collections of vectorial training examples, our framework learns using a collection of probability distributions that have been constructed to meaningfully represent training data. By representing …

2012-02-29abs ↗pdf ↗

Symmetric binary matrices representing relations among entities are commonly collected in many areas. Our focus is on dynamically evolving binary relational matrices, with interest being in inference on the relationship structure and prediction. We propose a nonparametric Bayesian dynamic model, which reduces dimension…

2013-11-19abs ↗pdf ↗

We evaluated the effectiveness of an automated bird sound identification system in a situation that emulates a realistic, typical application. We trained classification algorithms on a crowd-sourced collection of bird audio recording data and restricted our training methods to be completely free of manual intervention.…

2018-09-04abs ↗pdf ↗

A new method achieves optimal uniformity in designs with minimal flexibility.

problem Achieving optimal uniformity in designs with minimal flexibility.
method Derive a lower bound on the uniformity constant and use a greedy construction to achieve this bound, then extend the scheme for more flexibility.
result A simple greedy construction achieves the optimal uniformity constant.

New framework for dense weighted networks with community-specific patterns.

problem Dense networks with varying edge weights across communities.
method Proposes a new model with functions mapping node characteristics to edge weights, requiring few parameters.
result Developed a bootstrap methodology for generating new networks.

A new method for analyzing adaptive experiments using kernel treatment effects.

problem Efficiently analyzing adaptive experiments that adjust treatment assignments based on outcomes.
method Kernel Treatment Effects (KTE) framework combining RKHS scores and witness functions.
result Effective for both mean shifts and higher-moment differences, outperforming adaptive baselines.

Model captures system input variations in latent space for actionable dynamics.

problem Learning dynamical systems from data without prescribing a mathematical model.
method Structured latent ODE model with stochastic factors of variation for each input.
result Improves generation of time-series data and inference of system inputs over baselines.

Traditional non-life reserving models largely neglect the vast amount of information collected over the lifetime of a claim. This information includes covariates describing the policy, claim cause as well as the detailed history collected during a claim's development over time. We present the hierarchical reserving mod…

2019-10-28abs ↗pdf ↗

This work improves LePU by modeling the annotation process more realistically.

problem Improving semi-supervised learning from positive and unlabeled data.
method Incorporates realistic models for the annotation process and proposes an inference algorithm.
result Established the identifiability of annotation process and classification function.

Deep neural networks with their large number of parameters are highly flexible learning systems. The high flexibility in such networks brings with some serious problems such as overfitting, and regularization is used to address this problem. A currently popular and effective regularization technique for controlling the…

2017-11-30abs ↗pdf ↗

Estimates neuronal connectivity from spike times using flexible Hawkes processes.

problem Learning latent network structure from multivariate point process data.
method Proposes a new nonstationary Hawkes process and uses sparse least squares estimation.
result Establishes non-asymptotic error bounds and selection consistency for estimated parameters.

Flexible tree ensemble learning framework supports arbitrary loss functions and multi-task learning.

problem Limited modeling capabilities of existing tree ensemble learning toolkits.
method Differentiable tree ensembles with tensor-based formulation for efficient training.
result Our framework leads to 100x more compact and 23% more expressive tree ensembles.

We introduce the implicit processes (IPs), a stochastic process that places implicitly defined multivariate distributions over any finite collections of random variables. IPs are therefore highly flexible implicit priors over functions, with examples including data simulators, Bayesian neural networks and non-linear tr…

2018-06-06abs ↗pdf ↗

Imitation Learning (IL) is an appealing approach to learn desirable autonomous behavior. However, directing IL to achieve arbitrary goals is difficult. In contrast, planning-based algorithms use dynamics models and reward functions to achieve goals. Yet, reward functions that evoke desirable behavior are often difficul…

2018-10-15abs ↗pdf ↗

A plethora of networks is being collected in a growing number of fields, including disease transmission, international relations, social interactions, and others. As data streams continue to grow, the complexity associated with these highly multidimensional connectivity data presents novel challenges. In this paper, we…

2016-08-07abs ↗pdf ↗

The hierarchical Dirichlet process (HDP) has become an important Bayesian nonparametric model for grouped data, such as document collections. The HDP is used to construct a flexible mixed-membership model where the number of components is determined by the data. As for most Bayesian nonparametric models, exact posterio…

2012-01-08abs ↗pdf ↗

Method enhances anomaly detection using contrastive learning and out-of-distribution data.

problem Improving anomaly detection in datasets with limited out-of-distribution data.
method Proposes a contrastive learning method that incorporates out-of-distribution data to enhance anomaly detection performance.
result The method significantly improves anomaly detection performance, even with limited out-of-distribution data.

We consider the problem of finding the minimizer of a function f:RdRf: \mathbb{R}^d \rightarrow \mathbb{R} of the finite-sum form minf(w)=1/ninfi(w)\min f(w) = 1/n\sum_{i}^n f_i(w). This problem has been studied intensively in recent years in the field of machine learning (ML). One promising approach for large-scale data is to use a stoc…

2017-10-27abs ↗pdf ↗

Contrastive unsupervised representation learning (CURL) is the state-of-the-art technique to learn representations (as a set of features) from unlabelled data. While CURL has collected several empirical successes recently, theoretical understanding of its performance was still missing. In a recent work, Arora et al. (2…

2019-10-10abs ↗pdf ↗

Ranking data arises in a wide variety of application areas but remains difficult to model, learn from, and predict. Datasets often exhibit multimodality, intransitivity, or incomplete rankings---particularly when generated by humans---yet popular probabilistic models are often too rigid to capture such complexities. In…

2018-09-13abs ↗pdf ↗

This paper addresses the problem of learning dictionaries for multimodal datasets, i.e. datasets collected from multiple data sources. We present an algorithm called multimodal sparse Bayesian dictionary learning (MSBDL). MSBDL leverages information from all available data modalities through a joint sparsity constraint…

2018-04-10abs ↗pdf ↗

Unified and simplified signature method for multivariate time series.

problem Challenging application of signature method due to its flexibility.
method Generalised signature method unifying various techniques.
result Competitive performance against benchmarks for multivariate time series classification.

DDN models flexible free-form conditional distributions.

problem Difficulty in explicitly approximating arbitrary conditional distributions.
method Deconvolutional neural network framework for discretizing continuous domains.
result DDN outperforms other density-estimation methods on various tasks.

Paper tackles federated learning with personalised bandit algorithms.

problem Optimizing local and global objectives in a heterogeneous environment.
method Surrogate objective function combining client preferences and global knowledge; phase-based elimination algorithm.
result Achieves sublinear regret with logarithmic communication overhead.

We introduce scalable deep kernels, which combine the structural properties of deep learning architectures with the non-parametric flexibility of kernel methods. Specifically, we transform the inputs of a spectral mixture base kernel with a deep architecture, using local kernel interpolation, inducing points, and struc…

2015-11-06abs ↗pdf ↗

This work improves policy-based training by proposing an evaluation balance objective for GFlowNets.

problem Reliable estimation of policy divergence under directed acyclic graphs remains challenging.
method Proposes an evaluation balance objective over partial episodes to measure policy divergence and improve policy-based training reliability.
result Evaluation balance strengthens policy-based training reliability and broadens its flexibility.

Neural network method estimates covariate-dependent graphical models with statistical guarantees.

problem Estimating graph structure from covariate-dependent data.
method Neural network approach that allows flexible functional dependency on covariates.
result Theoretical PAC guarantees for the method's performance.

Motivation: The rapid growth of diverse biological data allows us to consider interactions between a variety of objects, such as genes, chemicals, molecular signatures, diseases, pathways and environmental exposures. Often, any pair of objects--such as a gene and a disease--can be related in different ways, for example…

2017-08-10abs ↗pdf ↗

Pylearn2 is a machine learning research library. This does not just mean that it is a collection of machine learning algorithms that share a common API; it means that it has been designed for flexibility and extensibility in order to facilitate research projects that involve new or unusual use cases. In this paper we g…

2013-08-20abs ↗pdf ↗

A neural network (NN) is a parameterised function that can be tuned via gradient descent to approximate a labelled collection of data with high precision. A Gaussian process (GP), on the other hand, is a probabilistic model that defines a distribution over possible functions, and is updated in light of data via the rul…

2018-07-04abs ↗pdf ↗