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

81162243324 · Jun 202019922001200920172026
48 results for binary values

The paper analyzes network models with binary values and sub-Gamma noise, deriving asymptotic properties.

problem Analyzing network models with binary values and sub-Gamma noise.
method Derives asymptotic properties of network models with binary values and sub-Gamma noise.
result Established asymptotic consistency and normality of parameter estimators in network models.

Fuzzy prediction sets generalize binary predictions to include elements at varying confidence levels.

problem Binary prediction sets are limited; fuzzy prediction sets offer richer guarantees.
method Generalize prediction sets to fuzzy sets, showing they are e-values with merging properties.
result Optimal e-values lead to optimal fuzzy prediction sets, including optimal conformal prediction.

This work analyzes centered binary Restricted Boltzmann Machines (RBMs) and binary Deep Boltzmann Machines (DBMs), where centering is done by subtracting offset values from visible and hidden variables. We show analytically that (i) centering results in a different but equivalent parameterization for artificial neural …

2013-11-06abs ↗pdf ↗

This paper investigates the problem of determining a binary-valued function through a sequence of strategically selected queries. The focus is an algorithm called Generalized Binary Search (GBS). GBS is a well-known greedy algorithm for determining a binary-valued function through a sequence of strategically selected q…

2009-10-22abs ↗pdf ↗

The generic identification problem is to decide whether a stochastic process (Xt)(X_t) is a hidden Markov process and if yes to infer its parameters for all but a subset of parametrizations that form a lower-dimensional subvariety in parameter space. Partial answers so far available depend on extra assumptions on the pro…

2011-01-19abs ↗pdf ↗

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.

An attractive approach for fast search in image databases is binary hashing, where each high-dimensional, real-valued image is mapped onto a low-dimensional, binary vector and the search is done in this binary space. Finding the optimal hash function is difficult because it involves binary constraints, and most approac…

2015-01-05abs ↗pdf ↗

Just as semantic hashing can accelerate information retrieval, binary valued embeddings can significantly reduce latency in the retrieval of graphical data. We introduce a simple but effective model for learning such binary vectors for nodes in a graph. By imagining the embeddings as independent coin flips of varying b…

2018-03-25abs ↗pdf ↗

Binary PheNorm extends phenotype labeling for EHRs using binary silver labels.

problem Lack of gold-standard phenotype labels in EHR studies.
method Proposes Binary PheNorm, an extension that uses binary silver labels directly in phenotype scoring.
result Binary PheNorm achieved strong discrimination using binary labels alone and improved performance when combined with count labels.

Paper discusses binary classification with metric space predictors, privacy constraints, and convergence rates.

problem Binary classification with metric space predictors under privacy constraints.
method Derives convergence rates for Proto-NN classifier with and without privacy constraints.
result Proto-NN classifier is universally consistent under privacy constraints.

A matrix completion problem, which aims to recover a complete matrix from its partial observations, is one of the important problems in the machine learning field and has been studied actively. However, there is a discrepancy between the mainstream problem setting, which assumes continuous-valued observations, and some…

2018-03-13abs ↗pdf ↗

Binary representation is desirable for its memory efficiency, computation speed and robustness. In this paper, we propose adjustable bounded rectifiers to learn binary representations for deep neural networks. While hard constraining representations across layers to be binary makes training unreasonably difficult, we s…

2015-11-19abs ↗pdf ↗

Cubic predicts stock market indices by fusing stock latent embeddings and converting to binary classification.

problem Challenges in predicting stock market indices due to isolated time series treatment and simple regression.
method Fusion of stock latent embeddings, binary encoding classification, and confidence-guided prediction.
result Cubic outperforms state-of-the-art baselines in stock index prediction tasks.

We give a graphical theory of integral indefinite binary Hamiltonian forms ff analogous to the one by Conway for binary quadratic forms and the one of Bestvina-Savin for binary Hermitian forms. Given a maximal order O\mathcal O in a definite quaternion algebra over Q\mathbb Q, we define the waterworld of ff, analog…

2018-10-15abs ↗pdf ↗

The paper discusses thresholds and bounds for accuracy in binary classification systems.

problem The accuracy of binary classification systems and its dependence on prevalence.
method Analyzing the precision-prevalence curve and negative predictive value-prevalence curve to find thresholds and bounds.
result Thresholds (φeφ_e and φnφ_n) bound various accuracy metrics (Fβ, F1, FM, MCC) and the ratio of maximum accuracy to prevalence.

The goal of Ordinal Regression is to find a rule that ranks items from a given set. Several learning algorithms to solve this prediction problem build an ensemble of binary classifiers. Ranking by Projecting uses interdependent binary perceptrons. These perceptrons share the same direction vector, but use different bia…

2019-11-25abs ↗pdf ↗

Scaling feature values is an important step in numerous machine learning tasks. Different features can have different value ranges and some form of a feature scaling is often required in order to learn an accurate classifier. However, feature scaling is conducted as a preprocessing task prior to learning. This is probl…

2014-07-28abs ↗pdf ↗

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.

Proposes a novel SVM model for binary classification with different misclassification costs.

problem Real-world classification problems with varying misclassification costs.
method Incorporates performance constraints in SVM formulation to seek a hyperplane with maximal margin and misclassification rates below given thresholds.
result The proposed model gives users control over misclassification rates in one class at the expense of the other.

The paper confirms two groups of gamma-ray bursts using a new nonparametric metric.

problem Determining the number of inherent groups in gamma-ray bursts.
method A new nonparametric interpoint distance-based measure, combined with clustering methods.
result Confirms two groups of short and long gamma-ray bursts.

Study robust learning of Lipschitz functions under corrupted binary signals.

problem Learning a Lipschitz function with corrupted binary signals in a context of unknown corruption rounds.
method Introduced agnostic checking and new analysis techniques to design algorithms for symmetric and pricing losses.
result Achieved small cumulative loss for both symmetric and pricing losses.

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 ↗

Study estimates heterogeneous principal causal effects with binary treatments and intermediate variables.

problem Estimating subgroup effects within strata defined by potential values of an intermediate variable.
method Proposes a framework for estimating and forming confidence intervals for heterogeneous principal causal effects under principal ignorability assumption. Develops several estimators with varying robustness properties.
result Established large-sample theory and analyzed bias contributions of each approach.

We consider the estimation of binary election outcomes as martingales and propose an arbitrage pricing when one continuously updates estimates. We argue that the estimator needs to be priced as a binary option as the arbitrage valuation minimizes the conventionally used Brier score for tracking the accuracy of probabil…

2017-03-18abs ↗pdf ↗

A new weighted MCC measure improves classifier performance evaluation.

problem Lack of measures sensitive to observation weights in multiclass classification.
method Proposes weighted versions of Pearson-Matthews Correlation Coefficient (MCC) for binary and multiclass classification.
result Weighted MCC values are higher for classifiers that perform better on highly weighted observations.

The paper explores how Shapley value for a feature can vary based on model outcomes and feature distribution.

problem The uniqueness of Shapley value in explaining model predictions.
method Analyzes the relationship between feature distribution and Shapley value, and compares Shapley values for different model outcomes.
result Shapley value for a feature depends on more than just its mean and can vary significantly based on model outcome.

Paper bounds convergence rate of adversarial surrogate risk.

problem Vulnerability of binary classification models to adversarial attacks.
method Characterizes conditions for adversarial consistency and provides surrogate risk bounds.
result Surrogate risk bounds quantify the rate of convergence of adversarial classification risk.

New framework for fairness in machine learning models using SHAP values and adversarial learning.

problem Fairness of model predictions, especially for unprivileged groups.
method Develops a new fairness definition and a framework using SHAP values and adversarial learning to mitigate bias.
result Models produced are fairer and performant, demonstrating the approach on various datasets.