We found a unified formula for description of the household incomes of all society classes, for instance, of those of the European Union in year 2007. This formula is a stationary solution of the threshold Fokker-Planck equation (derived from the threshold nonlinear Langevin one). The formula is more general than the w…
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
48 results for “threshold formulas”
Study on homology of random Čech complexes on manifolds with boundary.
problem Understanding the homology of random Čech complexes on manifolds with boundary.
method Analysis of a homogeneous Poisson process in a Riemannian manifold with boundary.
result Two asymptotic threshold formulas for the homology recovery of a manifold by a random Čech complex.
We compute the log canonical thresholds of non-negatively curved singular hermitian metrics on ample linearized line bundles on bi-equivariant group compactifications of complex reductive groups. To this end, we associate to any such metric a convex function whose asymptotic behavior determines the log canonical thresh…
Graphical Lasso (GL) is a popular method for learning the structure of an undirected graphical model, which is based on an regularization technique. The objective of this paper is to compare the computationally-heavy GL technique with a numerically-cheap heuristic method that is based on simply thresholding the s…
Modeling firm default with a variable threshold based on management decisions.
problem Estimating default probability with asymmetric information.
method Generalized structural model with a variable default threshold.
result The information level significantly impacts default probability and credit yield spread.
Herein, we applied statistical physics to study incomes of three (low-, medium- and high-income) society classes instead of the two (low- and medium-income)classes studied so far. In the frame of the threshold nonlinear Langevin dynamics and its threshold Fokker-Planck counterpart, we derived a unified formula for desc…
Paper derives new option pricing formulas and approximations for a local volatility model with discontinuity.
problem Modeling extreme ATM skew in a local volatility model with discontinuity.
method Uses joint distribution of Skew Brownian motion and its functionals to derive option pricing formulas and approximations.
result Derives an approximation of option prices by Black-Scholes prices, simplifying skew behavior.
Explicit moments of decision times for single- and double-threshold drift-diffusion processesq-bio.NC
We derive expressions for the first three moments of the decision time (DT) distribution produced via first threshold crossings by sample paths of a drift-diffusion equation. The "pure" and "extended" diffusion processes are widely used to model two-alternative forced choice decisions, and, while simple formulae for ac…
Optimizes SSVEP-based BCI performance by automating threshold selection.
problem Improving classification accuracy of SSVEP-based brain-computer interfaces.
method Formalizes ITR maximization, derives a general formula, and automates threshold selection.
result Achieved ITR of 62 bit/min, outperforming previous methods by a factor of 2.
Learning β for k-SAT with one sample is hard, especially for low degrees.
problem Learning the parameter β for k-SAT with a single sample.
method Single-sample learning of k-SAT formulas with a given satisfying assignment.
result One-shot learning for k-SAT is infeasible well below the satisfiability threshold, even for low degrees.
A new formula reveals symmetries between mean excess and ES functions.
problem Optimizing risk measures in financial models.
method Established a reverse ES optimization formula.
result Reveals elegant symmetries and relationships between mean excess and ES functions.
Spectral method detects communities in sparse hypergraphs, achieving detection threshold.
problem Community detection in sparse hypergraphs.
method Non-backtracking operator and spectral approach.
result Spectral method achieves detection threshold for sparse HSBMs.
The minimizer of a volume function is unique for klt singularities.
problem Uniqueness of the minimizer of the normalized volume function for klt singularities.
method Defining stability thresholds for valuations and showing K-semistability.
result The minimizer of the normalized volume function for a klt singularity is unique up to rescaling.
Paper uses bond pricing and convexity adjustments to explain herd immunity paradox.
problem Early onset of herd immunity contradicts R value estimates from early stage growth.
method Utilizes Vasicek's bond pricing formula and de Finetti's Theorem approach.
result Reduces modeling discrepancy to simple convexity formulas.
Algorithm learns CNF formulas from random solutions under specific conditions.
problem Learning a CNF formula from uniform random solutions.
method Revisits Valiant's algorithm and applies Lovász local lemma conditions.
result Significantly reduces sample complexity for learning CNFs.
Unified formula for training dynamics of linear networks combining lazy and balanced regimes.
problem Training dynamics of linear networks in two distinct setups: lazy and balanced/active.
method Unified formula for the evolution of the learned matrix, combining lazy and balanced regimes.
result Unified formula allows for rapid convergence and low rank bias, proving a complete phase diagram.
The paper finds optimal threshold strategies for insurance companies with a positive terminal value at creeping ruin.
problem Optimizing dividend payments in an insurance company's surplus process with a positive terminal value at creeping ruin.
method Using fluctuation theory, the paper derives explicit formulas for the objective function and shows the optimality of threshold strategies.
result Threshold strategies are optimal for the dividend optimization problem under certain conditions.
Formula for critical points of chi fields on manifolds.
problem Computing critical points of chi fields on general manifolds.
method Semi-analytic formula using Kac-Rice argument and Hessian matrix representation.
result Expression for expected value of critical points in high-threshold limit.
Gradient descent forces neural network eigenvalues to a specific threshold.
problem Understanding why gradient descent drives eigenvalues to a specific threshold.
method Introduced edge coupling, a functional on consecutive iterate pairs, to explain the trajectory towards the eigenvalue threshold.
result Gradient descent forces the Hessian eigenvalue to the threshold from arbitrary initialization.
The trade-off between the cost of acquiring and processing data, and uncertainty due to a lack of data is fundamental in machine learning. A basic instance of this trade-off is the problem of deciding when to make noisy and costly observations of a discrete-time Gaussian random walk, so as to minimise the posterior var…
Within the context of the banking-related literature on contingent convertible bonds, we comprehensively formalise the design and features of a relatively new type of insurance-linked security, called a contingent convertible catastrophe bond (CocoCat). We begin with a discussion of its design and compare its relative …
Global existence of Willmore flow with boundary via Li-Yau inequality.
problem Global existence of Willmore flow with boundary conditions.
method Extending Li-Yau inequality to surfaces with boundary and using geometric measure theory.
result Global existence of Willmore flow with Dirichlet boundary data below a specific energy threshold.
Paper offers a fast method to assess DeFi liquidation risk.
problem Assessing liquidation risk in DeFi stablecoin lending.
method Modeling collateral exchange rate as zero-drift geometric Brownian motion.
result Derives an exact formula for liquidation probability.
Study the geometry of matrix multiplication in deep neural networks.
problem Understanding the structure of matrix multiplication in deep neural networks.
method Using quiver representations and equivariant cohomology, determine codimension and irreducible components.
result Codimension and number of top-dimensional irreducible components of matrix multiplication are invariant under permutations and have specific log-canonical thresholds.
DNF-Net tackles tabular data challenges with neural architecture.
problem Handling tabular data efficiently using neural networks.
method DNF-Net uses a neural architecture with inductive bias corresponding to logical Boolean formulas in disjunctive normal form over affine soft-threshold decision terms.
result DNF-Net significantly outperforms fully connected networks on tabular data.
Iterative thresholding algorithms seek to optimize a differentiable objective function over a sparsity or rank constraint by alternating between gradient steps that reduce the objective, and thresholding steps that enforce the constraint. This work examines the choice of the thresholding operator, and asks whether it i…
Developed a new thresholding method that connects soft and hard thresholding.
problem Connecting soft and hard thresholding methods in data analysis.
method Scaled soft thresholding method with empirical scaling values.
result Found two sources of over-fitting in the scaled soft thresholding method.
The restricted Boltzmann machine is a graphical model for binary random variables. Based on a complete bipartite graph separating hidden and observed variables, it is the binary analog to the factor analysis model. We study this graphical model from the perspectives of algebraic statistics and tropical geometry, starti…
Study on critical points in random neural networks, revealing three regimes based on activation function.
problem Investigating the expected number of critical points in random neural networks.
method Deriving asymptotic formulas for critical points under infinite-width limit and suitable regularity conditions.
result Three distinct regimes of critical points behavior depending on activation function.
We study a spectral initialization method that serves a key role in recent work on estimating signals in nonconvex settings. Previous analysis of this method focuses on the phase retrieval problem and provides only performance bounds. In this paper, we consider arbitrary generalized linear sensing models and present a …
New method detects communities in complex hypergraphs, matching theoretical limits.
problem Detecting communities in non-uniform hypergraphs with varying hyperedge sizes.
method Developed a spectral theory for weighted non-backtracking operators on non-uniform hypergraphs.
result Achieved the Kesten-Stigum bound for weak recovery in a general class of non-uniform HSBMs.
PLS-SVD struggles with missing data in multimodal datasets, showing a phase transition in performance.
problem Missing data in PLS-SVD for multimodal datasets.
method Replica-symmetric analysis of spiked rectangular random matrices with missing entries.
result PLS-SVD performance transitions from uninformative to informative singular vectors at a critical signal-to-noise threshold.
New algorithm for reinforcement learning in uncertain environments with unknown thresholds.
problem Safety in reinforcement learning in unknown and uncertain environments.
method Growing-Window estimator sampling and Stochastic Pessimistic-Optimistic Thresholding (SPOT) algorithm.
result Achieves sublinear regret and constraint violation of .
New formulas forecast fractional Brownian motion for financial trading.
problem Forecasting financial log-prices following fractional Brownian motion.
method Theoretical formulas for accuracy metrics in fBm forecasting.
result Optimal trading strategies in fBm framework identified.
A new SSL method uses instance-dependent thresholds to improve accuracy.
problem Improving semi-supervised learning by better selecting confident unlabeled instances.
method Proposes instance-dependent thresholds that vary based on the ambiguity and error rates of pseudo-labels for each unlabeled instance.
result Demonstrates that instance-dependent thresholds provide a probabilistic guarantee for correct pseudo-labels.
Study stability thresholds of big line bundles, proving bounds and generalizing results.
problem Stability thresholds of big line bundles and their asymptotic behavior.
method Explicit bounds on error terms, using quasi-monomial valuations to compute stability thresholds.
result Proves Jin--Rubinstein--Tian's questions affirmatively.
Adaptive algorithm for outlier detection by balancing arm exploration and threshold estimation.
problem Identifying outliers in a set of rewards where the threshold is a function of all rewards.
method Adaptively updated confidence interval for the threshold based on previous rounds' estimates, balancing exploration of individual arms and the outlier threshold.
result Efficient algorithm with reduced sample complexity for outlier detection.
The Identification of Thresholds and Time Delay in Self-Exciting Threshold AR Model by Waveletmath-ph
In this paper we studied about the wavelet identification of the thresholds and time delay for more general case without the constraint that the time delay is smaller than the order of the model. Here we composed an empirical wavelet from the SETAR (Self-Exciting Threshold Autoregressive) model and identified the thres…
The article examines different thresholding methods for improving PAM algorithm in cancer classification.
problem High-dimensional classification with too many features selected by PAM.
method Extends PAM with hard and order thresholding methods and a deep search algorithm.
result Improved cancer status prediction accuracy and smaller number of features.
In the work of Ammann, Dahl and Humbert it has turned out that the Yamabe invariant on closed manifolds is a bordism invariant below a certain threshold constant. A similar result holds for a spinorial analogon. These threshold constants are characterized through Yamabe-type equations on products of spheres with rescal…
Study on complexity of random polynomials with deterministic spikes, identifying phase transitions.
problem Complexity of random Gaussian polynomials with deterministic spikes on a sphere.
method Variational formulas, Kac-Rice formula, determinant asymptotics of finite-rank perturbation of Gaussian Wigner matrices.
result Identification of a topological phase transition in the complexity function.
Although the threshold network is one of the most used tools to characterize the underlying structure of a stock market, the identification of the optimal threshold to construct a reliable stock network remains challenging. In this paper, the concept of dynamic consistence between the threshold network and the stock ma…
Model quantifies market sentiment using news data.
problem Quantifying high-frequency market sentiment for economists.
method Support vector machine classifiers for sentiment analysis; stochastic volatility model for joint evolution.
result News sentiment raises the threshold of volatility reversion.
Conservative Likelihood Ratio Estimator for Infrequent Data Slightly above a Frequency Thresholdstat.ML
Proposes a conservative LR estimator for infrequent data near a frequency threshold.
problem Overestimation of likelihood ratios for infrequent data near a frequency threshold.
method Conservative likelihood ratio estimator for frequencies slightly above a threshold.
result Improves prediction accuracy in named entity context prediction.
New method trains neural networks with threshold activation functions efficiently.
problem Training neural networks with threshold activation functions is challenging due to zero gradients.
method We study weight decay regularized training problems of deep neural networks with threshold activations, showing they can be formulated as convex optimization problems.
result Regularized deep threshold network training problems can be formulated as standard convex optimization problems, paralleling the LASSO method.
Noise makes learning linear thresholds hard, but algorithms can still learn near-optimal thresholds.
problem Learning linear thresholds in noisy data.
method Exploiting natural assumptions on data-generating process.
result Efficient learning of near-optimal linear thresholds is still possible with small data even in the presence of noise.
Bayesian framework proves thresholds for multi-graph alignment feasibility.
problem Determining when multi-graph alignment is statistically possible.
method Developed a Bayesian estimation framework over metric spaces.
result Identified thresholds for Gaussian and sparse Erdős-Rényi models.
A new method for optimizing stakes in a single event with multiple outcomes.
problem Maximizing expected log wealth in a single event with multiple outcomes.
method Using implicit state positions to derive the optimal stake formula.
result A compact formula and greedy algorithm for support selection.