We consider the symmetric exclusion process on suitable random grids that approximate a compact Riemannian manifold. We prove that a class of random walks on these random grids converge to Brownian motion on the manifold. We then consider the empirical density field of the symmetric exclusion process and prove that it …
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
48 results for “symmetric exclusion process”
Spaces of polynomials are shown to be Euclidean balls.
problem Understanding the geometry of Lorentzian and real stable polynomials.
method Refined connection between symmetric exclusion process and polynomial geometry.
result Spaces of Lorentzian and real stable polynomials are homeomorphic to closed Euclidean balls.
Study of SO(3)-irreducible geometry in complex 5D and ternary Pauli exclusion principle.
problem Exploring SO(3)-irreducible geometry in complex 5D.
method Defined a ternary skew-symmetric tensor, split the 10D space into irreducible SO(3) subspaces, found invariants and defined geometric structures.
result Defined a SO(3)-irreducible geometric structure on a 5D complex Hermitian manifold.
Many practical applications such as gene expression analysis, multi-task learning, image recognition, signal processing, and medical data analysis pursue a sparse solution for the feature selection purpose and particularly favor the nonzeros \emph{evenly} distributed in different groups. The exclusive sparsity norm has…
An exclusion particle model is considered as a highly simplified model of a limit order market. Its price behavior reproduces the well known crossover from over-diffusion (Hurst exponent H>1/2) to diffusion (H=1/2) when the time horizon is increased, provided that orders are allowed to be canceled. For early times a ma…
In this paper, we develop a loop group description of harmonic maps ``of finite uniton type", from a Riemann surface into inner symmetric spaces of compact or non-compact type. This develops work of Uhlenbeck, Segal, and Burstall-Guest to non-compact inner symmetric spaces. To be mo…
Racah matrices and higher -symbols are used in description of braiding properties of conformal blocks and in construction of knot polynomials. However, in complicated cases the logic is actually inverted: they are much better deduced from these applications than from the basic representation theory. Following the re…
Somewhat unexpectedly, the study of the family of twisted knots revealed a hidden structure behind exclusive Racah matrices , which control non-associativity of the representation product in a peculiar channel . These are simultaneously symmetric and orthogo…
Study growth patterns in random networks using i.i.d. perturbations.
problem Understanding the growth of affine regions in random piecewise-linear networks.
method Analyzes a random compositional model with i.i.d. perturbations of the tent map, proving submultiplicative pressure and using finite-state defect process for upper-tail lower bounds.
result Proves the existence of a submultiplicative pressure for \(N_n\) and gives exponential upper bounds for \(n^{-1}\log N_n\).
This paper investigates the use of distributed processing on the problem of emotion recognition from physiological sensors using a popular machine learning library on distributed mode. Specifically, we run a random forests classifier on the biosignal-data, which have been pre-processed to form exclusive groups in an un…
Research quantifies financial exclusion risks in UK, focusing on cash infrastructure and socio-economic factors.
problem Localised financial exclusion in the UK as cash infrastructure declines.
method Developed a composite indicator using various input variables.
result Financial exclusion is more prevalent in deprived communities and affluent areas.
Differential Expansion for antiparallel triple pretzels: the way the factorization is deformedhep-th
Factorization of DE coefficients is violated in antiparallel triple pretzels, but described elegantly.
problem Understanding the origins of factorization in double braids and its extension to antiparallel triple pretzels.
method Defect-preserving deformation from trefoil to antiparallel triple pretzels, analysis of DE coefficients.
result Factorization of DE coefficients is violated but described by an elegant formula for symmetric representations.
A RL framework selects features to balance bias and accuracy dynamically.
problem Bias in automated feature selection when predictors are correlated.
method Multi-component reward function with policy gradient for dynamic regularization and bias mitigation.
result Model balances fairness and accuracy during training.
Joint Exclusivitymath.ST
Introduces joint exclusivity (JE), a new form of negative dependence.
problem Negative dependence structures in probability distributions.
method Defines JE by exclusion of the interior of the non-negative orthant, establishes necessary and sufficient conditions for existence, proposes a canonical construction.
result Sharp necessary and sufficient condition for existence of JE random vectors with prescribed marginals.
Extends conformal prediction to contrastive learning for better coverage of positive samples.
problem Lack of principled guarantees on coverage in contrastive learning.
method Introduces minimum-volume covering sets with learnable constraints.
result Improves inclusion-exclusion trade-offs in positive and negative samples.
We study the dynamics of co-evolution of producers and customers described by bit-strings representing individual traits. Individual ''size-like'' properties are controlled by binary encounters which outcome depends upon a recognition process. Depending upon the parameter set-up, mutual selection of producers and custo…
Bose-Einstein Condensation in Competitive Processescond-mat.stat-mech
We introduce an irreversible discrete multiplicative process that undergoes Bose-Einstein condensation as a generic model of competition. New players with different abilities successively join the game and compete for limited resources. A player's future gain is proportional to its ability and its current gain. The the…
Exclusive Group Lasso improves feature selection in correlated biological data.
problem Correlated features hinder Lasso performance in biological classification problems.
method Proposes and solves the exclusive group Lasso, combining stability selection and random group allocation.
result Exclusive Group Lasso outperforms Lasso in comprehensive selection of informative features.
Exclusive Lasso improves survival prediction in cancer datasets.
problem Enhanced survival prediction in cancer datasets with high-dimensional genomic and clinical data.
method Proposes Exclusive Lasso regularization for feature selection in Cox regression models for grouped variables.
result Demonstrates improved survival prediction performance using Exclusive Lasso compared to standard Cox regression.
Paper develops a new method for harmonic maps into symmetric spaces.
problem Tackles harmonic maps of finite uniton number into symmetric spaces.
method Uses loop group description and DPW theory to transform results.
result Establishes a 1-1 relation between harmonic maps and normalized potentials.
In this paper, we investigate the problem of learning disentangled representations. Given a pair of images sharing some attributes, we aim to create a low-dimensional representation which is split into two parts: a shared representation that captures the common information between the images and an exclusive representa…
TIE framework detects out-of-distribution samples and estimates uncertainty without external datasets.
problem Detecting and estimating uncertainty for out-of-distribution samples in neural networks.
method TIE framework extends a classifier to an (n+1)-class model, iteratively refining through training, inversion, and exclusion.
result Unified and interpretable framework for robust anomaly detection and calibrated uncertainty estimation.
New method selects variables in groups with few nonzeros, improving support recovery.
problem Structured variable selection with sparse patterns across groups.
method Composite norm and proximal algorithm for exclusive group sparsity.
result Asymptotic consistency in signed support recovery under conventional assumptions.
New kernels on symmetric groups enable efficient Gaussian process sampling.
problem Efficiently modeling and sampling on symmetric groups.
method Introduced power sum kernels and methods for efficient calculation and sampling.
result Polynomial computational complexity for sampling Gaussian processes.
We describe the inclusive Racah matrices for the first non-(anti)symmetric rectangular representation R=[2,2] for quantum groups U_q(sl_N). Most of them have sizes 2, 3, and 4 and are fully described by the eigenvalue hypothesis. Of two 6x6 matrices, one is also described in this way, but the other one corresponds to t…
Exclusive Topic Modelingstat.ML
ETM identifies field-specific keywords in text classification.
problem Unsupervised text classification with field-specific keywords.
method Weighted Lasso penalty and pairwise Kullback-Leibler divergence penalty for topic separation.
result ETM improves topic coherence by 22% and 10% compared to LDA.
Negative screening is one method to avoid interactions with inappropriate entities. For example, financial institutions keep investment exclusion lists of inappropriate firms that have environmental, social, and government (ESG) problems. They create their investment exclusion lists by gathering information from variou…
This research shows how to learn shared representations from unpaired data.
problem Learning shared representations from unpaired data.
method Spectral embeddings of random walk matrices from each unimodal representation.
result Shared representations can be learned almost exclusively from unpaired data.
Nonlinear RNNs' memory capacity varies widely, making it impractical.
problem The usefulness of memory capacity as a metric for linear RNNs is questioned.
method Analysis of random nonlinear RNNs with varying input scales.
result Memory capacity of nonlinear RNNs is arbitrary and impractical.
The installation process of offshore wind turbines requires the use of expensive jack-up vessels. These vessels regularly report their position via the Automatic Identification System (AIS). This paper introduces a novel approach of applying machine learning to AIS data from jack-up vessels. We apply the new method to …
A Killing -form on a Riemannian manifold is a -form whose covariant derivative is totally anti-symmetric. In this paper we give the complete (local) description of 4-dimensional Riemannian manifolds (M,g) carrying non-parallel Killing 2-forms . If is connected and oriented, we show that there exists …
New study analyzes security of neural network data reconstruction attacks.
problem Data reconstruction attacks pose a threat to private training data.
method Analyzes security boundary of data reconstruction attacks via neuron exclusivity state.
result Characterizes insecure/secure boundary of data reconstruction attacks.
This work explores variably scaled kernels to improve non-stationary Gaussian processes.
problem Limited ability of stationary kernels to represent heterogeneous correlation structures.
method Introduces variably scaled kernels to modify correlation structures explicitly.
result Improved reconstruction accuracy and better uncertainty estimates for non-stationary data.
A Poisson convolution model for characterizing topical content with word frequency and exclusivitycs.LG
An ongoing challenge in the analysis of document collections is how to summarize content in terms of a set of inferred themes that can be interpreted substantively in terms of topics. The current practice of parametrizing the themes in terms of most frequent words limits interpretability by ignoring the differential us…
Unsupervised learning is becoming more and more important recently. As one of its key components, the autoencoder (AE) aims to learn a latent feature representation of data which is more robust and discriminative. However, most AE based methods only focus on the reconstruction within the encoder-decoder phase, which ig…
Paper extends Kodaira dimension's role in Yamabe invariant for most complex surfaces.
problem Determining the sign of Yamabe invariant for compact complex surfaces.
method Analyzing Kodaira dimension and using simplified proof techniques.
result Pattern of Yamabe invariant sign depends on Kodaira dimension for most surfaces.
Paper analyzes history-based RL methods for MDPs, introduces a theoretical framework and practical algorithm.
problem Improving RL performance in MDPs using history-based features.
method Theoretical framework for history-based RL, practical algorithm design.
result Practical RL algorithm shows effectiveness on continuous control tasks.
Deep semi-supervised anomaly detection improves fraud detection in financial markets.
problem Detecting fraud in high-frequency financial data with limited labeled examples.
method Evaluation of Deep Semi-Supervised Anomaly Detection (Deep SAD) on proprietary limit order book data.
result Deep SAD significantly improves fraud detection accuracy with minimal labeled data.
New model for fair clustering ensures balanced representation of protected attributes.
problem Ensuring fair representation in clustering for protected attributes.
method Model-based formulation of fair clustering, balancing protected attributes across clusters.
result Demonstrates improved fairness in clustering through a new model.
Optimal loss-carry-forward taxation for Lévy risk processes stopped at general draw-down timeq-fin.MF
Motivated by Kyprianou and Zhou (2009), Wang and Hu (2012), Avram et al. (2017), Li et al. (2017) and Wang and Zhou (2018), we consider in this paper the problem of maximizing the expected accumulated discounted tax payments of an insurance company, whose reserve process (before taxes are deducted) evolves as a spectra…
Stable processes emerge as limits of deep neural networks with symmetric stable distributions.
problem Understanding the behavior of deep neural networks as they become infinitely wide.
method Analyzing fully connected feed-forward deep neural networks with symmetric stable distributions and showing the limit as a stable process.
result The infinite wide limit of the network is a stable process with multivariate stable distributions.
The latter author, together with collaborators, proposed a numerical scheme to calculate the price of barrier options. The scheme is based on a symmetrization of diffusion process. The present paper aims to give a mathematical credit to the use of the numerical scheme for Heston or SABR type stochastic volatility model…
We seek to infer the parameters of an ergodic Markov process from samples taken independently from the steady state. Our focus is on non-equilibrium processes, where the steady state is not described by the Boltzmann measure, but is generally unknown and hard to compute, which prevents the application of established eq…
Inspired by the human visual perception system, hexagonal image processing in the context of machine learning deals with the development of image processing systems that combine the advantages of evolutionary motivated structures based on biological models. While conventional state-of-the-art image processing systems o…
There is often latent network structure in spatial and temporal data and the tools of network analysis can yield fascinating insights into such data. In this paper, we develop a nonparametric method for network reconstruction from spatiotemporal data sets using multivariate Hawkes processes. In contrast to prior work o…
The paper bounds eigenvalues and integrals of eigenfunctions on hyperbolic manifolds.
problem Eigenvalues and integrals of eigenfunctions on compact hyperbolic manifolds.
method Spectral decompositions and consistency conditions derived from quadruple overlap integrals.
result Upper bounds on Laplacian eigenvalues and triple overlap integrals.
Paper proposes a method to quantify and explain machine learning uncertainty in predictive process monitoring.
problem Neglect of data-driven estimation, point forecasts without model uncertainty, and lack of explanations.
method Quantile Regression Forests for interval predictions and SHapley Additive Explanations for uncertainty.
result Effective handling of model uncertainty in predictive process monitoring.
Transformers tend to learn more symmetric functions in sequence data.
problem Understanding inductive bias in Transformers with infinitely over-parameterized models.
method Analyzing Transformers in the Gaussian process limit, using representation theory of the symmetric group.
result Transformers are biased towards more permutation symmetric functions, and this can be quantitatively predicted.