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

4386129172 · Jun 202019922001200920172026
48 results for discrete units

We propose a discrete surface theory in R3\mathbb R^3 that unites the most prevalent versions of discrete special parametrizations. This theory encapsulates a large class of discrete surfaces given by a Lax representation and, in particular, the one-parameter associated families of constant curvature surfaces. The theo…

2014-12-23abs ↗pdf ↗

We present a framework for learning disentangled and interpretable jointly continuous and discrete representations in an unsupervised manner. By augmenting the continuous latent distribution of variational autoencoders with a relaxed discrete distribution and controlling the amount of information encoded in each latent…

2018-03-31abs ↗pdf ↗

This paper provides an explicit form for symmetric differentials and their corresponding holomorphic functions.

problem Understanding the correspondence between symmetric differentials and L2L^2 holomorphic functions on quotient spaces.
method Explicit description of the correspondence between symmetric differentials and weighted L2L^2-holomorphic functions.
result Derivation of several applications based on the explicit form of the correspondence.

The paper addresses misspecification in econometric models of discrete unobserved heterogeneity.

problem Misspecification in econometric models of discrete unobserved heterogeneity.
method Generalizing previous approaches to allow multiple latent variables, developing inference results for a k-means style estimator, and proposing information criteria for model selection.
result Over-fitting can be severe in k-means style estimators when the number of clusters is over-specified.

Lu conjecture proven for minimal 2-spheres and surfaces under certain conditions.

problem Discreteness of constant scalar curvatures of compact minimal submanifolds in unit spheres.
method Refined Simons' first gap theorem and Yau's theorems for high-codimensional submanifolds.
result Lu's conjecture for minimal 2-spheres and surfaces proved under inequality conditions.

Study infinite circle patterns in the Weil-Petersson class using discrete harmonic functions.

problem Characterize infinite circle patterns in the Weil-Petersson class.
method Investigate circle patterns parameterized by discrete harmonic functions of finite Dirichlet energy, equipped with a Riemannian metric.
result Induced quasiconformal homeomorphisms from the unit disk to itself belong to the Weil-Petersson class.

PyDTS analyzes survival data with discrete intervals and competing risks.

problem Discrete-time survival analysis with competing risks and optional penalization.
method Regularized estimation methods, model evaluation metrics, variable screening tools, and simulation module.
result Supports research and development in discrete-time survival analysis.

Skew parallelogram nets factorize, encompassing discrete differential geometry.

problem Factorization of polynomials in discrete differential geometry.
method Lax representation, Bäcklund transformations, factorization of polynomials.
result Skew parallelogram nets encompass all systems with polynomial representations.

Cycloids, hipocycloids and epicycloids have an often forgotten common property: they are homothetic to their evolutes. But what if use convex symmetric polygons as unit balls, can we define evolutes and cycloids which are genuinely discrete? Indeed, we can! We define discrete cycloids as eigenvectors of a discrete doub…

2017-02-02abs ↗pdf ↗

The paper confirms conjectures about the topology of triangulated polyhedra and geodesic triangulations on spheres.

problem Topology of spaces of convex polyhedra and Delaunay triangulations on spheres.
method Variational principles on triangulated surfaces.
result Spaces of Delaunay triangulations have the same homotopy types as their smooth counterparts on the unit 2-sphere.

Parameters in deep neural networks which are trained on large-scale databases can generalize across multiple domains, which is referred as "transferability". Unfortunately, the transferability is usually defined as discrete states and it differs with domains and network architectures. Existing works usually heuristical…

2018-04-23abs ↗pdf ↗

New method for discrete-time survival analysis with competing risks.

problem Discrete failure time data in survival analysis.
method Proposes a new estimation procedure for discrete-time survival analysis with competing events.
result Offers advantages over existing procedures and integrates regularized regression methods.

The aim of this work is to enable inference of deep networks that retain high accuracy for the least possible model complexity, with the latter deduced from the data during inference. To this end, we revisit deep networks that comprise competing linear units, as opposed to nonlinear units that do not entail any form of…

2018-05-19abs ↗pdf ↗

We introduce the index i(v) = 1 - X(S(v)) for critical points of a locally injective function f on the vertex set V of a simple graph G=(V,E). Here S(v) = {w in E | (v,w) in E, f(w)-f(v)<0} is the subgraph of the unit sphere at v in G. It is the exit set of the gradient vector field. We prove that the sum of i(v) over …

2012-01-05abs ↗pdf ↗

Boltzmann machines (BMs) are appealing candidates for powerful priors in variational autoencoders (VAEs), as they are capable of capturing nontrivial and multi-modal distributions over discrete variables. However, non-differentiability of the discrete units prohibits using the reparameterization trick, essential for lo…

2018-05-18abs ↗pdf ↗

Study utility indifference pricing with delayed investment information in a Bachelier model.

problem Investment decisions based on delayed information in a Bachelier model.
method Developed discrete-time duality and used techniques from [7] to compute scaling limits.
result Utility indifference prices scaling limit for vanishing delay with quadratic penalty.

IH-GAN models cellular structures accurately and improves structural performance.

problem Optimizing variable-density cellular structures with multiscale design challenges.
method Conditional deep generative model (IH-GAN) for property-to-geometry mapping using implicit function parameterization.
result Generates unit cells with high accuracy and improves structural performance.

Improved training for VQ-VAE models with robust codebook learning.

problem Challenges in training discrete latent variable models, especially VQ-VAEs.
method Increased learning rate and periodic re-initialization of codebook for robust training.
result More robust training and increased usage of latent codewords, even for large codebooks.

Compact hyperbolic complex manifolds are rigid under deformation.

problem Studying the deformation behavior of compact hyperbolic complex manifolds.
method Analyzing smooth families of compact complex manifolds over the unit disk and compact Riemann surfaces.
result The HH-locus is either at most a discrete subset or the whole domain, depending on the family structure.

Deep belief networks are a powerful way to model complex probability distributions. However, learning the structure of a belief network, particularly one with hidden units, is difficult. The Indian buffet process has been used as a nonparametric Bayesian prior on the directed structure of a belief network with a single…

2009-12-31abs ↗pdf ↗

The Rolling Ball Theorem asserts that given a convex body K in Euclidean space and having a smooth surface bd(K) with all principal curvatures not exceeding c>0 at all boundary points, K necessarily has the property that to each boundary point there exists a ball B_r of radius r=1/c, fully contained in K and touching b…

2009-03-27abs ↗pdf ↗

Study on Gauss map of anisotropic minimal surfaces with Morse index estimates.

problem Estimating the Morse index of anisotropic minimal surfaces.
method Local analysis of Gauss map, conformal geometric techniques applied to the Gauss map.
result Upper and lower estimates for the Morse index of anisotropic minimal surfaces.

Quantum computing optimizes ESG portfolios efficiently.

problem Optimizing investment portfolios with risk, return, and ESG considerations.
method Formulated discrete Markowitz portfolio theory (DMPT) for quantum annealers, incorporating ESG ratings.
result Discrete portfolios converge to continuous solutions as budgets increase, outperforming traditional methods.

CRUs model irregular time series with continuous hidden states.

problem Handling irregular time intervals in sequential data.
method Continuous Recurrent Units (CRUs) that integrate hidden states via a linear stochastic differential equation.
result CRUs outperform methods based on neural ordinary differential equations in irregular time series interpolation.

This article proposes Multinomial Probit Bayesian Additive Regression Trees (MPBART) as a multinomial probit extension of BART - Bayesian Additive Regression Trees (Chipman et al (2010)). MPBART is flexible to allow inclusion of predictors that describe the observed units as well as the available choice alternatives. T…

2013-09-30abs ↗pdf ↗