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

3.1%6.1%9.2%12.2% · Jun 201919922001200920182026
48 results for Bernoulli tests

Algorithm learns smooth probability functions from Bernoulli tests with guarantees.

problem Learning smooth probability functions from Bernoulli tests with contextual features.
method Scalable algorithm with rigorous L2-norm convergence guarantees for posterior update rule.
result Empirical convergence rates match theoretical guarantees, superior to state-of-the-art.

Unified framework for structure learning via conditional independence testing.

problem Optimal structure learning and conditional independence testing.
method Established a fundamental connection and reduction between structure learning and conditional independence testing.
result Optimal rates for structure learning are determined by conditional independence testing rates.

Study phase transitions in identifying infected individuals using group testing.

problem Identifying a set of k infected individuals from a population using pooled tests.
method Two random assignment designs (constant-column and Bernoulli) and polynomial-time inference procedures.
result Sharp phase transitions in statistical and computational limits for detection and recovery problems.

Rule-based classifiers quantify uncertainty using Bernoulli random variables.

problem Quantifying the uncertainty of precision estimates for rule-based text classifiers.
method Treat partitions of sub-strings as Bernoulli random variables, compare means using statistical tests, and combine classifiers using Dempster-Shafer theory.
result The approach can be used to combine binary classifiers into a multi-label classifier.

The paper analyzes how employers can efficiently screen candidates using multiple tests, considering both skill estimation and fairness.

problem How to efficiently screen candidates using multiple noisy signals without violating fairness.
method The paper extends traditional screening models to a multi-test setting, analyzing optimal employer policies for both fixed and dynamic test assignments.
result A fundamental impossibility emerges when noise levels vary across groups, making it impossible to administer the same number of tests and maintain the same outcomes.

BeMF improves recommendation reliability in recommender systems.

problem Improving reliability in recommender systems beyond accuracy.
method Bernoulli Matrix Factorization (BeMF) for model-based collaborative filtering.
result BeMF selects more reliable predictions, improving recommendation quality.

Characterizes symmetric Bernoulli distributions with minimal convex sums.

problem Understanding minimal dependence among Bernoulli random vectors.
method Geometric and algebraic representations of multivariate symmetric Bernoulli distributions.
result Characterizes extremal negative dependence and builds minimal dependence copulas.

A novel method for estimating Bayesian network (BN) parameters from data is presented which provides improved performance on test data. Previous research has shown the value of representing conditional probability distributions (CPDs) via neural networks(Neal 1992), noisy-OR gates (Neal 1992, Diez 1993)and decision tre…

2013-01-10abs ↗pdf ↗

A novel multi-resolution cluster detection (MCD) method is proposed to identify irregularly shaped clusters in space. Multi-scale test statistic on a single cell is derived based on likelihood ratio statistic for Bernoulli sequence, Poisson sequence and Normal sequence. A neighborhood variability measure is defined to …

2012-05-09abs ↗pdf ↗

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 ↗

Finite index solutions to Bernoulli problem are always axially symmetric.

problem Entire solutions to the Bernoulli free boundary problem with finite Morse index in 3D.
method Proof of axial symmetry for finite index solutions.
result Finite index solutions to the Bernoulli problem in 3D are axially symmetric.

A drone-based MOT algorithm tracks vehicles using neural network detections and TPMBM filter.

problem Tracking multiple vehicles from drone-mounted cameras.
method Neural network for object detection, TPMBM filter for trajectory estimation, von-Mises Fisher distribution for DOA.
result TPMBM filter optimally estimates vehicle trajectories.

Bayesian autoencoders improve OOD detection by addressing Bernoulli likelihood issues.

problem Out-of-distribution (OOD) detection fails with Bernoulli likelihood for certain datasets.
method Proposes Bayesian autoencoders and alternative likelihood models to fix the issue.
result Bayesian autoencoders and alternative likelihood models improve OOD detection accuracy.

This paper proposed a new regression model called l1l_1-regularized outlier isolation and regression (LOIRE) and a fast algorithm based on block coordinate descent to solve this model. Besides, assuming outliers are gross errors following a Bernoulli process, this paper also presented a Bernoulli estimate model which, …

2014-06-01abs ↗pdf ↗

We solve Euler equations on graph manifolds, classifying steady flows with Morse-Bott Bernoulli functions.

problem Classifying steady Euler flows with Morse-Bott Bernoulli functions.
method Constructing non-vanishing steady solutions using integrable systems and topology.
result Steady Euler flows with Morse-Bott Bernoulli functions exist only on graph three-manifolds.

The paper cleans label noise in supervised classification using Bernoulli sampling.

problem Label noise degrades supervised classifier performance.
method Proposes a label noise cleaning method based on Bernoulli random sampling.
result The method separates clean and noisy observations without prior label information.

This paper tackles open problem of tight bounds for KBs with Bernoulli rewards.

problem Open problem of tight bounds for Kernelized Bandits with Bernoulli rewards.
method Focus on Bernoulli model, not subgaussian noise, and optimize function in RKHS.
result Open problem remains unsolved in this context.

A new method for efficient nonlinear process monitoring using random Bernoulli features.

problem High computational demands and real-time responsiveness in online monitoring systems.
method Random Bernoulli principal component analysis to capture nonlinear patterns efficiently.
result The proposed methods offer excellent scalability and reduced computational complexity.

The structure of a Bayesian network encodes most of the information about the probability distribution of the data, which is uniquely identified given some general distributional assumptions. Therefore it's important to study the variability of its network structure, which can be used to compare the performance of diff…

2009-09-09abs ↗pdf ↗

Proposes a new method for feature selection in non-linear functions.

problem Feature selection for non-linear functions in high-dimensional data.
method Continuous relaxation of Bernoulli distributions to learn feature selection indicators via gradient descent.
result Demonstrates the effectiveness of the approach on synthetic and real-life applications.

A/B testing refers to the task of determining the best option among two alternatives that yield random outcomes. We provide distribution-dependent lower bounds for the performance of A/B testing that improve over the results currently available both in the fixed-confidence (or delta-PAC) and fixed-budget settings. When…

2014-05-13abs ↗pdf ↗

A new method uses Mean Field Games to optimize mixture models of Bernoulli and categorical distributions.

problem Optimizing parameters of finite mixture models of Bernoulli and categorical distributions.
method Mean Field Games theory applied to multi-population systems.
result The Mean Field Games approach provides a method to compute mixture model parameters.

First order invariants of generic immersions of manifolds of dimension nm-1 into manifolds of dimension n(m+1)-1, m,n>1 are constructed using the geometry of self-intersections. The range of one of these invariants is related to Bernoulli numbers. As by-products some geometrically defined invariants of regular homotopy…

1999-04-08abs ↗pdf ↗

New LL-functions for 3-manifolds connect to Witten invariants and relate to generalized Bernoulli polynomials.

problem Understanding LL-functions for 3-manifolds and their invariants.
method Using Mellin transforms and asymptotic techniques, proving entire functions and their values.
result Linear relations between LL-function values at negative integers, generalizing known zeta functions.

Improved regret bounds for DP-KLUCB and DP-IMED in Bernoulli bandits.

problem Minimizing regret in stochastic bandits under ε-global Differential Privacy.
method Developed DP versions of KLUCB and IMED, proving tighter lower bounds and matching upper bounds.
result DP-KLUCB and DP-IMED achieve asymptotically optimal regret under ε-global DP.

Paper compares credit portfolio risks using robust Bernoulli mixture models.

problem Tackles risk bounds and comparison of credit portfolio losses.
method Uses Bernoulli mixture models with conditional independence and stochastic increasing defaults.
result Provides conditions for comparing conditional default probabilities and portfolio losses.

New acquisition functions improve Bernoulli LSE.

problem Efficiently estimating regions where a Bernoulli function is above or below a threshold.
method Developed new look-ahead acquisition functions for Gaussian process classification models.
result Demonstrated clear benefits of new acquisition functions on benchmark and real-world tasks.

A new framework predicts links in time-dependent networks using Bernoulli autoregression.

problem Predicting links in time-dependent networks with additional auxiliary information.
method A Bernoulli autoregressive model with regularization for link discovery.
result The model can discover new links not present in the data.

The paper proves ML estimators are strongly consistent for identifying edge weights in BAR models.

problem Identifying edge weights in Bernoulli Autoregressive (BAR) models.
method Maximum Likelihood (ML) estimation for two variants of BAR models.
result ML estimators are strongly consistent for edge weight identification.

Study analyzes symmetric two-armed Bernoulli bandit problem with zero mean gap.

problem Analyzing symmetric two-armed Bernoulli bandit problem with zero mean gap.
method Associated with a solution of a linear heat equation, compute leading order terms of minmax optimal regret and pseudoregret.
result Explicitly compute leading order terms in three scaling regimes for the gap.

Exact simulation of correlated binary outcomes using PMF constraints and linear programming.

problem Simulating dependent Bernoulli outcomes with specific means and correlations.
method Formulate the problem over the joint Bernoulli PMF, impose constraints, and solve as a linear program. Use convex-hull characterization and truncated-moment completion scheme for feasibility and simulation.
result Exact simulation framework for correlated binary outcomes, providing a convex-hull characterization and truncated-moment completion scheme.

A new sampling method balances multi-label datasets by preserving category frequency order.

problem Sampling challenges in multi-label datasets with varying label frequencies.
method Uses multivariate Bernoulli distribution and label dependencies to estimate and weight label combinations.
result Produces a more balanced sub-sample with enhanced representation of minority categories.