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

87173260346 · Jun 202019922001200920172026
48 results for multiplicative transitions

Study phase transitions with prescribed mean curvature in Riemannian manifolds.

problem Understanding phase transitions with prescribed mean curvature in geometric settings.
method Analyzing solutions to inhomogeneous semilinear elliptic PDEs, establishing bounds and asymptotics.
result Established upper and lower bounds for eigenvalues of phase transition problems.

This paper identifies and estimates the label noise transition matrix without ground truth labels.

problem Learning with noisy labels and identifying the noise transition matrix.
method Building on Kruskal's identifiability results, the paper characterizes the identifiability of the label noise transition matrix for the generic case at the instance level.
result The necessity of multiple noisy labels in identifying the noise transition matrix for the generic case at the instance level.

We develop a topology data analysis-based method to detect early signs for critical transitions in financial data. From the time-series of multiple stock prices, we build time-dependent correlation networks, which exhibit topological structures. We compute the persistent homology associated to these structures in order…

2017-01-21abs ↗pdf ↗

In this paper we show that Cartan geometries can be studied via transitive Lie groupoids endowed with a special kind of vector-valued multiplicative 1-forms. This viewpoint leads us to a more general notion, that of Cartan bundle, which encompasses both Cartan geometries and G-structures.

2019-11-29abs ↗pdf ↗

Just like Atiyah Lie algebroids encode the infinitesimal symmetries of principal bundles, exact Courant algebroids are believed to encode the infinitesimal symmetries of S1S^1-gerbes. At the same time, transitive Courant algebroids may be viewed as the higher analogue of Atiyah Lie algebroids, and the non-commutative a…

2017-01-04abs ↗pdf ↗

Proposes a method for approximating transition densities of SDEs driven by gamma processes.

problem Calculating transition densities for SDEs driven by gamma processes.
method Taylor-type approximation and conditional expectation of multiple stochastic integrals.
result Efficiency of the proposed method demonstrated through numerical tests.

New STH distance finds patterns in event timeseries without resampling.

problem Lack of efficient analysis methods for event and state timeseries.
method Define STE-ts, propose STH, leveraging both time and state duration.
result Improved precision and computation time compared to resampled metrics.

Deep conditional generative models are developed to simultaneously learn the temporal dependencies of multiple sequences. The model is designed by introducing a three-way weight tensor to capture the multiplicative interactions between side information and sequences. The proposed model builds on the Temporal Sigmoid Be…

2016-05-22abs ↗pdf ↗

Persistent entropy detects phase transitions in complex systems.

problem Detecting phase transitions in complex systems.
method Established a general theorem for persistent entropy to reliably detect phase transitions, introduced operational framework for finite-time computations.
result Persistent entropy exhibits an asymptotically non-vanishing gap across phases, robust numerical signatures across experiments.

NERS improves RL by sampling diverse transitions considering local and global contexts.

problem Sampling biases in experience replay lead to redundant transitions.
method Neural Experience Replay Sampler (NERS) that considers both local and global contexts.
result NERS significantly improves RL performance by sampling diverse and meaningful transitions.

This thesis extends Yang-Mills theory to Lie groupoids and algebroids, overcoming integrability and transitivity constraints.

problem Generalizing Yang-Mills theory to non-integrable and non-transitive settings.
method Introduces multiplicative Ehresmann connections and develops the theory of connections on Lie groupoids and algebroids.
result Extends Yang-Mills theory to a non-integrable and non-transitive setting, providing a pair of equations for gauge fields.

A novel multi-resolution Gaussian process model for efficient time traversal.

problem Inference for long sequences with fast and slow transitions is difficult.
method A novel Gaussian process state-space architecture composed of multiple components, each trained on a different resolution.
result The combined model allows efficient inference for arbitrarily long sequences with complex dynamics.

TempLe learns transition templates for efficient multi-task RL.

problem Efficiently transferring knowledge across different RL tasks with varying state/action spaces.
method Generates transition dynamics templates to abstract similarities between tasks.
result Achieves significantly lower sample complexity than single-task or multi-task methods.

This paper constructs quandles with abelian inner automorphism groups from graphs, proving their homogeneity.

problem Finding quandles with specific automorphism properties.
method Starting from simple graphs, the paper constructs quandles with abelian inner automorphism groups and proves their homogeneity.
result Homogeneous quandles with abelian inner automorphism groups are constructed from vertex-transitive graphs.

We study unsupervised multilingual alignment, the problem of finding word-to-word translations between multiple languages without using any parallel data. One popular strategy is to reduce multilingual alignment to the much simplified bilingual setting, by picking one of the input languages as the pivot language that w…

2020-01-28abs ↗pdf ↗

A new approach uses circuit topology to study complex polymer interactions.

problem Understanding structural phase transitions in entangled polymer systems.
method Braided circuit topology framework for multiple-chain systems.
result Circuit topological motif fractions are effective order parameters for structural transitions.

Improves GCNNs with node transition probabilities and DropNode regularization.

problem Over-fitting and over-smoothing issues in GCNNs.
method Message passing based on node transition probabilities and DropNode regularization.
result Improved GCNNs with better node representations and reduced over-fitting and over-smoothing.

New model for pairwise comparisons without stochastic transitivity.

problem Suboptimal performance of models assuming stochastic transitivity in real-world scenarios.
method Proposes a general family of statistical models using a skew-symmetric matrix.
result Achieves minimax-rate optimality and adapts to data sparsity.

The paper studies complex genera and related geometric applications, deriving formulas for multiple zeta values.

problem Understanding coefficients in Chern numbers for complex genera.
method Examining Chern numbers for complex genera, focusing on specific genera like Td^(1/2), Γ, and Todd.
result Unified formulas for multiple zeta values and transition matrices among symmetric functions.

Study on detecting hierarchical community structures in networks.

problem Detecting hierarchical community structures in networks.
method Analysis of planted hierarchies of partitions in networks, identifying additional detectability phases.
result There are additional phases in which the presence of multiple consistent partitions can either help or hinder detection of hierarchical structures.

The paper tackles joint learning of linear systems, improving accuracy with pooled data.

problem Estimating transition matrices of multiple related linear systems more accurately.
method Developed novel techniques to bound estimation errors and establish high probability bounds for singular values.
result Significant gains in accuracy achieved by pooling data across systems.

Model place cells as spatial embeddings for efficient path planning and cognitive map construction.

problem Encoding spatial navigation in the hippocampus.
method Model place cells using spectral decomposition of multi-step random walk transition kernels, inducing sparsity and adjacency.
result Place cells encode spatial information through non-negativity and inner-product structure, forming a cognitive map.

We study learning latent models with multi-instance weak supervision.

problem Learning latent models with multi-instance weak supervision.
method Formulated as multi-instance Partial Label Learning (multi-instance PLL), proposed a necessary and sufficient condition for learnability, derived Rademacher-style error bounds.
result First theoretical study of multi-instance PLL with unknown transition function, aligns with empirical results but highlights scalability issues.

UCB-TQL learns from multiple tasks with shared dynamics and adapts to task-specific variations.

problem Transfer reinforcement learning with composite MDPs where tasks share core dynamics but have sparse differences.
method UCB-TQL, a novel transfer RL algorithm for composite MDPs.
result Achieved a regret bound of ildeO(eH5N) ilde{O}(\sqrt{eH^5N}) that scales independently of the ambient dimension.

Solves complex clustering and rotation synchronization problem.

problem Challenges in classifying and synchronizing rotated objects into multiple categories.
method Semidefinite programming relaxations to solve the joint problem of community detection and synchronization.
result Exact recovery of community detection and synchronization when extending stochastic block model.

Log-Normal Multiplicative Dynamics improves low-precision training of neural networks.

problem Training large neural networks with low precision is unstable.
method Derive a Bayesian learning rule with log-normal posterior distributions and multiplicative updates.
result LMD achieves stable and accurate training for Vision Transformer and GPT-2.

This work improves transferability of rewards inferred from expert demonstrations.

problem Transferability of rewards inferred from expert demonstrations under limited access to the expert's policy.
method Proposed principal angles as a measure of similarity and dissimilarity between transition laws. Established sufficient conditions for transferability under limited access.
result Two key results on sufficient conditions for transferability to any and local changes in transition laws.

Recursive Feature Machines show grokking in modular arithmetic without neural networks.

problem Grokking in modular arithmetic tasks.
method Recursive Feature Machines (RFM) with Average Gradient Outer Product (AGOP).
result RFM and neural networks learn block-circulant features to solve modular arithmetic.

Unified approach to tensor PCA and related problems using tensor cumulants.

problem Statistical inference on invariant distributions, particularly tensor PCA.
method Definition and analysis of tensor cumulants to unify and extend previous results.
result Unified explanation of hardness and subexponential-time algorithms for tensor PCA.

We analyze an N+1N+1-player game and the corresponding mean field game with state space {0,1}\{0,1\}. The transition rate of jj-th player is the sum of his control αjα^j plus a minimum jumping rate ηη. Instead of working under monotonicity conditions, here we consider an anti-monotone running cost. We show that the mean …

2019-08-16abs ↗pdf ↗