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.

169,051 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Feb 199419922001200920182026
48 results for binary field

A spiking neural network model for probabilistic inference of binary Markov random fields.

problem Implementing probabilistic inference in spiking neural networks.
method Designing a spiking recurrent neural network and proving its equivalence to mean-field inference of binary Markov random fields.
result The spiking neural network model can implement inference of arbitrary binary Markov random fields.

The Bouncy Particle Sampler is a novel rejection-free non-reversible sampler for differentiable probability distributions over continuous variables. We generalize the algorithm to piecewise differentiable distributions and apply it to generic binary distributions using a piecewise differentiable augmentation. We illust…

2017-11-02abs ↗pdf ↗

Matrix factorization is a key tool in data analysis; its applications include recommender systems, correlation analysis, signal processing, among others. Binary matrices are a particular case which has received significant attention for over thirty years, especially within the field of data mining. Dictionary learning …

2018-04-16abs ↗pdf ↗

Study of quantum Riemannian geometries over binary field, finding many non-flat examples.

problem Classifying parallelizable quantum Riemannian geometries over F2\Bbb F_2.
method Classification of geometries up to dimension 3, characterizing quantum Laplacian eigenvectors.
result Found many non-flat quantum Riemannian geometries over F2\Bbb F_2.

Study shows proper initialisation of binary weights is crucial for deep neural networks.

problem Training stochastic binary neural networks with continuous surrogates is challenging.
method Developed new surrogates based on Markov chain theory and mean field analysis.
result Critical initialisations are necessary for training deep networks with binary weights.

Estimates binary labels from dependent data using Markov Random Fields.

problem Statistical estimation from dependent data across spatial, temporal, and social domains.
method Modeling dependencies as Markov Random Fields and providing efficient estimation algorithms.
result Statistically efficient estimation rates for Ising models from a single sample.

Phase segregation, the process by which the components of a binary mixture spontaneously separate, is a key process in the evolution and design of many chemical, mechanical, and biological systems. In this work, we present a data-driven approach for the learning, modeling, and prediction of phase segregation. A direct …

2018-03-23abs ↗pdf ↗

Machine learning struggles to predict binary options movements due to randomness.

problem Predicting binary options movements using machine learning.
method Tested multiple machine learning models (RF, LR, GB, kNN) and neural networks (MLP, LSTM) on EUR/USD currency pairs.
result None of the models surpassed the ZeroR baseline accuracy, indicating randomness in binary options.

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.

We construct an elementary, combinatorial kind of topological quantum field theory, based on curves, surfaces, and orientations. The construction derives from contact invariants in sutured Floer homology and is essentially an elaboration of a TQFT defined by Honda--Kazez--Matic. This topological field theory stores inf…

2012-01-22abs ↗pdf ↗

Efficiently identifies important variables in binary outcomes using variational Bayes.

problem Bayesian variable selection for binary outcomes with computational challenges.
method Mean-field variational Bayes approximation with closed-form updates and efficient inference algorithm.
result Successfully identifies important variables and is orders of magnitude faster than MCMC.

Study geodesics in curved spaces, counts ambiguous paths, confirms number theory conjectures.

problem Counting ambiguous geodesics in curved spaces.
method Asymptotic formula for common perpendiculars in negatively curved spaces, applying to modular orbifolds and number fields.
result Confirms and extends Motohashi's conjecture on binary additive divisor problem.

New method predicts binary matrix entries using empirical Bayes and low-rank structure.

problem Predicting unobserved entries in binary matrices.
method Empirical Bayes method motivated by Efron--Morris estimator, exploiting low-rank structure.
result Superior performance in predictive accuracy, calibration, and efficiency compared to existing methods.

Binary autoencoder with sparse hidden layer preserves information and zero reconstruction error.

problem Preserving information and zero reconstruction error in binary neural networks.
method Binary autoencoder with random binary weights, sparse hidden layer, and varying neuron thresholds.
result Zero reconstruction error for any input with a large hidden layer and varying neuron thresholds.

Probit regression was first proposed by Bliss in 1934 to study mortality rates of insects. Since then, an extensive body of work has analyzed and used probit or related binary regression methods (such as logistic regression) in numerous applications and fields. This paper provides a fresh angle to such well-established…

2018-02-01abs ↗pdf ↗

We present a new approach for mitigating unfairness in learned classifiers. In particular, we focus on binary classification tasks over individuals from two populations, where, as our criterion for fairness, we wish to achieve similar false positive rates in both populations, and similar false negative rates in both po…

2017-06-30abs ↗pdf ↗

Gaussian CRFBC model for binary classification with latent variables.

problem Binary classification problems with undirected graphs.
method Gaussian conditional random fields with latent variables, local variational approximation, Newton-Cotes formulas.
result Improved prediction performance compared to unstructured predictors.

Unified theory for training neural networks with binary synapses.

problem Discrete nature of synapses and complex interactions in neural networks.
method Variational mean-field theory decomposing learning into maximization and expectation steps.
result Unified framework for unsupervised learning in neural networks.

MCD reformulates conditional density estimation into binary classification.

problem Conditional density estimation in statistical and machine learning.
method Marginal Contrastive Discrimination, reformulating into marginal and ratio density functions for binary classification.
result Significantly outperforms existing methods on most density models and regression datasets.

Special orthogonal representations from octonions have geometric properties linked to binary cubics.

problem Understanding geometric properties of special orthogonal representations from octonions.
method Using octonions and their derivations, spinors, and covariants to show geometric properties.
result Covariants and Mathews identities of these representations are related to the Fano plane and (Z2)3(\mathbb{Z}_2)^3.

AFS-BM improves model accuracy by dynamically selecting features.

problem Feature selection challenges in ML, especially scalability and adaptability.
method Joint optimization for feature selection and model training with binary masking.
result AFS-BM achieves significant improvements in model accuracy and computational efficiency.

We introduce the notions of Atiyah class and Todd class of a differential graded vector bundle with respect to a differential graded Lie algebroid. We prove that the space of vector fields on a dg-manifold with homological vector field QQ admits a structure of L-infinity algebra with the Lie derivative LQL_Q as unary …

2015-02-10abs ↗pdf ↗

We show that over the binary field F2\mathbb F_2, the Bar-Natan perturbation of Khovanov homology splits as the direct sum of its two reduced theories, which we also prove are isomorphic. This extends Shumakovitch's analogous result for ordinary Khovanov homology, without the perturbation.

2015-08-24abs ↗pdf ↗

The paper analyzes the score field of diffusion models using Burgers dynamics.

problem Understanding the evolution of score fields in diffusion models.
method Analyzes the score field through Burgers-type evolution law for diffusion models.
result Identifies a universal \( anh\) interfacial term in the score field.

Interactive tool helps choose and understand classification metrics.

problem Common metrics for binary classification have limitations.
method Graphical application to visualize and explore evaluation metrics.
result Promotes careful attention to interpretation of metrics.

Over the (1,n)(1,n)-dimensional real superspace, n>1n>1, we classify K(n)\mathcal{K}(n)-invariant binary differential operators acting on the superspaces of weighted densities, where K(n)\mathcal{K}(n) is the Lie superalgebra of contact vector fields. This result allows us to compute the first differential cohomology of %the L…

2009-12-27abs ↗pdf ↗

Develops a fast BMF approach for binary matrices.

problem Finding patterns in binary matrices for various applications.
method MEBF (Median Expansion for Boolean Factorization) using geometric segmentation and heuristic submatrix identification.
result Superior performance in reconstruction error and computational efficiency compared to existing methods.

We consider the problem of learning the structure of Ising models (pairwise binary Markov random fields) from i.i.d. samples. While several methods have been proposed to accomplish this task, their relative merits and limitations remain somewhat obscure. By analyzing a number of concrete examples, we show that low-comp…

2009-10-30abs ↗pdf ↗

We propose a relaxation-based approximate inference algorithm that samples near-MAP configurations of a binary pairwise Markov random field. We experiment on MAP inference tasks in several restricted Boltzmann machines. We also use our underlying sampler to estimate the log-partition function of restricted Boltzmann ma…

2013-12-21abs ↗pdf ↗

Paper clarifies unary vs binary AV approaches and evaluates their performance.

problem Improperly treating authorship verification as a binary classification task.
method Literature review and evaluation of unary and binary AV methods.
result Improper binary classification leads to flawed AV methods.

Paper proposes neural networks for automatically naming assembly functions.

problem Automatically assigning names to assembly code functions.
method Formal definition of problem, baseline models (Seq2Seq, Transformer), fine-tuning neural networks.
result Neural networks can effectively predict function names in binaries, even outperforming state-of-the-art.

This paper applies deep learning to ordinal regression, modeling it as a binary search.

problem Ordinal regression with deep learning models.
method Formulated ordinal regression as a binary search problem, using recurrent neural networks.
result Deep learning model shows comparable or better predictive power compared to traditional methods.

Survey on assessing and improving classifier calibration for better decision making.

problem Ensuring classifiers correctly quantify prediction uncertainty.
method Overview of principles, methods, and evaluation metrics for calibration.
result New methods and extensions from binary to multiclass settings.