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

Trend · papers per month

265277103 · Jun 202019922001200920172026
48 results for multivariate binary

Modified Metropolis algorithm ensures convergence for multivariate binary distributions with fixed-order updates.

problem Infeasibility of standard Metropolis algorithm for multivariate binary distributions with fixed-order updates.
method Proposed a modified Metropolis transition operator ensuring irreducibility and convergence.
result Ensures convergence to the limiting distribution in multivariate binary case with fixed-order updates.

Deep belief networks can approximate any multivariate density with binary hidden units.

problem Approximating multivariate probability densities with binary hidden units.
method Sharp quantitative bounds on approximation error in terms of hidden units.
result Deep belief networks can approximate any multivariate density with binary hidden units under mild integrability requirements.

BEGIN network models binary data without parametric assumptions.

problem Conditional independence in non-parametric families of binary data.
method BEGIN network models binary data using sparse linear representations and block factorizations.
result BEGIN network captures conditional independence for arbitrary binary and multinomial variables.

A new method for binary ICA using non-stationary sources.

problem Independent component analysis of binary data.
method Linear mixing model in latent space, followed by binary observation model with non-stationary sources.
result Proves non-identifiability with few observed variables but identifies with more variables.

A method for representing and comparing categorical trajectories using multivariate functional principal components.

problem Statistical description and comparison of categorical trajectories.
method Transforming categorical trajectories into binary indicator functions and applying multivariate functional principal components analysis.
result Consistent estimators of mean trajectories and covariance functions are obtained under weak regularity assumptions.

Proposes an L1-regularized functional SVM for binary classification with functional covariates.

problem Binary classification with multivariate functional covariates.
method L1-regularized functional support vector machine (SVM) with an accompanying algorithm.
result The proposed classifier performs well in prediction and feature selection.

Graphical models are commonly used tools for modeling multivariate random variables. While there exist many convenient multivariate distributions such as Gaussian distribution for continuous data, mixed data with the presence of discrete variables or a combination of both continuous and discrete variables poses new cha…

2014-04-29abs ↗pdf ↗

Introduces FairCOCCO for fair learning with multitype, multivariate sensitive attributes.

problem Fairness in machine learning with multiple, complex sensitive attributes.
method FairCOCCO measure based on cross-covariance operators, incorporating a regularisation term.
result Consistent improvements in balancing fairness and predictive power on real-world datasets.

In this paper, we consider the multivariate Bernoulli distribution as a model to estimate the structure of graphs with binary nodes. This distribution is discussed in the framework of the exponential family, and its statistical properties regarding independence of the nodes are demonstrated. Importantly the model can e…

2012-06-08abs ↗pdf ↗

Large deviation principles for multivariate stochastic volatility models.

problem Understanding the behavior of log-processes in multivariate stochastic volatility models.
method Establishing a comprehensive sample path large deviation principle for log-processes.
result Asymptotic formulas for first exit times and barrier option prices derived from the LDP.

A new method prunes neural networks efficiently without losing effectiveness.

problem Efficient pruning of neural networks without sacrificing performance.
method Deterministic approximation of binary gates and L0L_0 regularization.
result Pruning neural networks significantly without loss in effectiveness.

A neural network with a single hidden layer can't represent certain multivariable functions.

problem Representing certain multivariable functions with a neural network having only one hidden layer.
method Developed a continuum version of a one-hidden-layer neural network with ReLU activation, and proved constraints on its parameters and second derivative.
result Existence of a smooth binary function that cannot be precisely represented by any such neural network.

EP method speeds up Bayesian probit regression in high dimensions.

problem Computational challenges in high-dimensional Bayesian probit regression.
method Adapting EP approximation to multivariate Gaussian prior and skew-normal distribution.
result EP routine is computationally feasible in high-dimensional settings.

Dimension reduction of multivariate data supervised by auxiliary information is considered. A series of basis for dimension reduction is obtained as minimizers of a novel criterion. The proposed method is akin to continuum regression, and the resulting basis is called continuum directions. With a presence of binary sup…

2016-06-20abs ↗pdf ↗

Identifies interpretable generative model for multivariate data.

problem Black-box architectures of deep generative models are often unidentified and difficult to interpret.
method Introduces Deep Discrete Encoder (DDE) Copula, a hierarchical binary latent variable model inside a copula framework.
result Establishes conditions for identification of DDE copula parameters and proves posterior consistency.

The multivariate probit model (MVP) is a popular classic model for studying binary responses of multiple entities. Nevertheless, the computational challenge of learning the MVP model, given that its likelihood involves integrating over a multidimensional constrained space of latent variables, significantly limits its a…

2018-03-22abs ↗pdf ↗

The study examines how bias affects hypothesis formation in neural networks.

problem Characterizing the impact of bias on hypothesis formation in neural networks.
method An automated data-driven projection pursuit neural network to extract and select features for binary classification.
result The refinement of a working hypothesis converges to a robust multivariate perception of data.

This paper describes a recursive estimation procedure for multivariate binary densities (probability distributions of vectors of Bernoulli random variables) using orthogonal expansions. For dd covariates, there are 2d2^d basis coefficients to estimate, which renders conventional approaches computationally prohibitive …

2011-12-07abs ↗pdf ↗

There has been a lot of work fitting Ising models to multivariate binary data in order to understand the conditional dependency relationships between the variables. However, additional covariates are frequently recorded together with the binary data, and may influence the dependence relationships. Motivated by such a d…

2012-09-27abs ↗pdf ↗

It is the main goal of this article to address the bipartite ranking issue from the perspective of functional data analysis (FDA). Given a training set of independent realizations of a (possibly sampled) second-order random function with a (locally) smooth autocorrelation structure and to which a binary label is random…

2013-12-18abs ↗pdf ↗

New exact tests detect changepoints in binary and count data, especially when normal approximations fail.

problem Detecting changepoints in multichannel binary and count data.
method Exact tests combining two-sample conditional tests with multiplicity correction.
result Exact tests are much more powerful than asymptotic tests in various settings.

MMM model clusters mixed-type longitudinal data efficiently.

problem Challenges in clustering multivariate longitudinal mixed-type data.
method MMM model reorganizes data into a three-way structure, using a mixture of matrix-variate normal distributions.
result MMM model handles various data types (continuous, ordinal, binary, nominal, count) and temporal dependence.

EagleEye detects localized density anomalies in multivariate data.

problem Identifying signal events, regime changes, or model mismatch in scientific data.
method EagleEye pinpoints local over- and under-densities by assigning anomaly scores based on binary membership sequences and binomial null models.
result EagleEye can detect genuine local anomalies and estimate background purity.

GGP models multivariate time series with latent sub-sequences for diverse behaviors.

problem Modeling multivariate time series with diverse behaviors and patterns.
method Graph Gamma Process (GGP) linear dynamical systems with latent sub-sequences.
result GGP models exhibit good predictive performance and reveal interpretable latent patterns.

Quantum algorithm estimates multivariate mean with near-optimal efficiency.

problem Estimating the mean of multivariate random variables efficiently in quantum computing.
method Combines amplitude amplification, quantum singular value transformation, and Bernstein-Vazirani algorithm.
result Quantum estimator outperforms classical estimators outside low-precision regime.

MULTIFIT tests independence between two random vectors using multiscale Fisher's test.

problem Detecting local dependence between two random vectors.
method MULTIFIT uses a resampling-free approach to test independence.
result MULTIFIT can easily handle large sample sizes and interpret dependency nature.

In recent years, there has been a growing interest in identifying anomalous structure within multivariate data streams. We consider the problem of detecting collective anomalies, corresponding to intervals where one or more of the data streams behaves anomalously. We first develop a test for a single collective anomaly…

2019-09-04abs ↗pdf ↗

Enhanced metrics for multiclass classification improve on existing methods.

problem Lack of decisive poor classification results in existing multiclass metrics.
method Introduces three new metrics derived from multivariate Pearson correlation coefficients.
result New metrics decisively indicate poor classification results.

Multivariate binary distributions can be decomposed into products of univariate conditional distributions. Recently popular approaches have modeled these conditionals through neural networks with sophisticated weight-sharing structures. It is shown that state-of-the-art performance on several standard benchmark dataset…

2017-03-22abs ↗pdf ↗

Study introduces a benchmark suite for evaluating neural MI estimators on real-world unstructured datasets.

problem Lack of comprehensive evaluation methods for neural MI estimators on real-world unstructured datasets.
method Developed a benchmark suite using same-class sampling and a binary symmetric channel trick.
result Showed accurate manipulation of true MI values of real-world datasets.

This paper investigates the ability of generative networks to convert their input noise distributions into other distributions. Firstly, we demonstrate a construction that allows ReLU networks to increase the dimensionality of their noise distribution by implementing a "space-filling" function based on iterated tent ma…

2018-10-26abs ↗pdf ↗

Proposes a method to estimate time-dependent probability density functions using binary classifiers.

problem Estimating time-dependent probability density functions of stochastic processes.
method Trains a time-dependent binary classifier to discriminate between realizations of a stochastic process at two nearby time instants.
result Explicitly models and accurately reconstructs complex time-dependent, multi-modal, and near-degenerate densities.