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,742 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Nov 199319922001200920172026
48 results for place representations

City2City translates place representations across cities using language translation techniques.

problem Lack of inter-city perspective in place representations from mobility data.
method Applied unsupervised machine language translation methods to translate place representations across different cities.
result Successfully translated place representations from one city to another, validated using landuse data.

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.

Many aspects of life are associated with places of human mobility patterns and nowadays we are facing an increase in the pervasiveness of mobile devices these individuals carry. Positioning technologies that serve these devices such as the cellular antenna (GSM networks), global navigation satellite systems (GPS), and …

2019-09-25abs ↗pdf ↗

Anosov representations of word hyperbolic groups into higher-rank semisimple Lie groups are representations with finite kernel and discrete image that have strong analogies with convex cocompact representations into rank-one Lie groups. However, the most naive analogy fails: generically, Anosov representations do not a…

2017-01-31abs ↗pdf ↗

We propose a novel learning framework to answer questions such as "if a user is purchasing a shirt, what other items will (s)he need with the shirt?" Our framework learns distributed representations for items from available textual data, with the learned representations representing items in a latent space expressing f…

2019-08-26abs ↗pdf ↗

We present a transductive deep learning-based formulation for the sparse representation-based classification (SRC) method. The proposed network consists of a convolutional autoencoder along with a fully-connected layer. The role of the autoencoder network is to learn robust deep features for classification. On the othe…

2019-04-24abs ↗pdf ↗

Space2Vec learns multi-scale spatial representations from grid cell insights.

problem Encoding spatial features with varying scales from GIS data.
method Proposes Space2Vec, a multi-scale representation learning model using grid cell insights.
result Space2Vec outperforms baselines in predicting POI types and image classification with geo-locations.

We present a universal knot polynomials for 2- and 3-strand torus knots in adjoint representation, by universalization of appropriate Rosso-Jones formula. According to universality, these polynomials coincide with adjoined colored HOMFLY and Kauffman polynomials at SL and SO/Sp lines on Vogel's plane, and give their ex…

2015-10-20abs ↗pdf ↗

A knot complement admits a pseudo-hyperbolic structure by solving Thurston's gluing equations for an octahedral decomposition. It is known that a solution to these equations can be described in terms of region variables, also called ww-variables. In this paper, we consider the case when pinched octahedra appear as a b…

2017-02-25abs ↗pdf ↗

Paper develops a framework for learning interpretable representations of sequential decision behavior.

problem Obtaining a transparent description of existing behavior.
method Inverse decision modeling framework, formalizing both forward and inverse problems.
result Learning interpretable representations of behavior, including suboptimal actions, biased beliefs, and imperfect knowledge.

Study uses trajectory embedding to measure place function similarity at fine spatial granularity.

problem Measuring place function similarity at fine spatial granularity.
method Trajectory embedding to reduce dimensions and measure similarity of place functions.
result Embedding similarity can be a metric proxy for place functions at fine spatial granularity.

This paper expresses the structure of artificial neural network (ANN) as a functional form, using the activation integral concept derived from the activation function. In this way, the structure of ANN can be represented by a simple function, and it is possible to find the mathematical solutions of ANN. Thus, it can be…

2019-08-27abs ↗pdf ↗

Proposes a method to learn invariant representations for interpretability and fairness.

problem Learning invariant representations to achieve interpretability in algorithmic fairness.
method Adversarially trained model with null-sampling procedure to produce invariant representations in the data domain.
result Shows effectiveness on image and tabular datasets.

I will explain my joint paper `Instantons moduli spaces and W-algebras' with A.Braverman, M.Finkelberg, arXiv:1406.2381. I will concentrate on the geometric part, that is a study of perverse sheaves on instanton moduli spaces. I place a particular emphasize on the hyperbolic restriction functor and stable envelop, whic…

2016-04-21abs ↗pdf ↗

Factorization of the differential expansion coefficients for HOMFLY-PT polynomials of double braids, discovered in arXiv:1606.06015 in the case of rectangular representations RR, is extended to the first non-rectangular representations R=[2,1]R=[2,1] and R=[3,1]R=[3,1]. This increases chances that such factorization will take p…

2016-12-01abs ↗pdf ↗

Motivated by the study of ribbon knots we explore symmetric unions, a beautiful construction introduced by Kinoshita and Terasaka 50 years ago. It is easy to see that every symmetric union represents a ribbon knot, but the converse is still an open problem. Besides existence it is natural to consider the question of un…

2007-05-31abs ↗pdf ↗

Improved Q-learning for multi-agent reinforcement learning by weighting joint action values.

problem QMIX restricts QQ-values to monotonic mixtures, limiting complex value functions.
method Introduced weighted projection to recover optimal policies, improving performance.
result CW QMIX and OW QMIX outperform baseline QMIX on multi-agent tasks.

Inspired by the paper on quantum knots and knot mosaics [23] and grid diagrams (or arc presentations), used extensively in the computations of Heegaard-Floer knot homology [2,3,7,24], we construct the more concise representation of knot mosaics and grid diagrams via mirror-curves. Tame knot theory is equivalent to knot…

2011-06-19abs ↗pdf ↗

In this paper I develop a new computational method for pricing path dependent options. Using the path integral representation of the option price, I show that in general it is possible to perform analytically a partial averaging over the underlying risk-neutral diffusion process. This result greatly eases the computati…

2000-05-19abs ↗pdf ↗

A new model predicts race places using changeover-times and log-normal distributions.

problem Predicting race places in orienteering races.
method Fenton-Wilkinson Order Statistics model based on log-normal leg-times and changeover-times.
result The model accurately predicts race places with smaller root-mean-square-errors.

Our results complement D. Calegari's result that there are no hyperbolic once-punctured torus bundles over S1S^1 with trace field having real place. We exhibit several infinite families of pairs (χ,p)(-χ, p) such that there exist hyperbolic surface bundles with over S1S^1 with fiber having pp punctures and Euler characte…

2010-05-20abs ↗pdf ↗

We introduce the Attentive Unsupervised Text (W)riter (AUTR), which is a word level generative model for natural language. It uses a recurrent neural network with a dynamic attention and canvas memory mechanism to iteratively construct sentences. By viewing the state of the memory at intermediate stages and where the m…

2018-06-13abs ↗pdf ↗

Study explores reinforcement learning in a complex game environment, analyzing rule inference and policy learning.

problem Learning optimal policies in environments with hidden rules.
method Investigated using the Game Of Hidden Rules (GOHR) environment, employing Feature-Centric and Object-Centric state representations with a Transformer-based A2C algorithm.
result Transformer-based A2C models outperform traditional methods in GOHR, demonstrating the effectiveness of representation strategies.

This is a survey article whose main goal is to explain how many components of the character variety of a closed surface are either deformation spaces of representations into the maximal compact subgroup or deformation spaces of certain Fuchsian representations. This latter family is of particular interest and is relate…

2018-09-18abs ↗pdf ↗

Zoetrope Genetic Programming improves symbolic regression performance.

problem Evolutionary symbolic regression for complex mathematical expressions.
method Zoetropic representation, repeated fusion operations, linear combination, crossover, mutation, selection.
result Zoetrope Genetic Programming achieves state-of-the-art performance and low computational time.

Period domains, the classifying spaces for (pure, polarized) Hodge structures, and more generally Mumford-Tate domains, arise as open GRG_{\mathbb{R}}--orbits in flag varieties G/PG/P. We investigate Hodge--theoretic aspects of the geometry and representation theory associated with these flag varieties. In particular, w…

2014-07-16abs ↗pdf ↗

Many machine learning algorithms are trained and evaluated by splitting data from a single source into training and test sets. While such focus on in-distribution learning scenarios has led to interesting advancement, it has not been able to tell if models are relying on dataset biases as shortcuts for successful predi…

2019-10-07abs ↗pdf ↗

Paper proposes a graph network for EHR data that learns robust representations.

problem Learning robust representations for EHR data with implicit connections.
method Variationally regularized encoder-decoder graph network.
result Model outperforms existing methods in various EHR predictive tasks.

Gaussian processes are flexible function approximators, with inductive biases controlled by a covariance kernel. Learning the kernel is the key to representation learning and strong predictive performance. In this paper, we develop functional kernel learning (FKL) to directly infer functional posteriors over kernels. I…

2019-10-29abs ↗pdf ↗

In this paper, we present Gamma-LSTM, an enhanced long short term memory (LSTM) unit, to enable learning of hierarchical representations through multiple stages of temporal abstractions. Gamma memory, a hierarchical memory unit, forms the central memory of Gamma-LSTM with gates to regulate the information flow into var…

2019-10-25abs ↗pdf ↗

Using the L^2 norm of the Higgs field as a Morse function, we study the moduli spaces of U(p,q)-Higgs bundles over a Riemann surface. We require that the genus of the surface be at least two, but place no constraints on (p,q). A key step is the identification of the function's local minima as moduli spaces of holomorph…

2002-11-27abs ↗pdf ↗

Variational Auto-encoders (VAEs) have been very successful as methods for forming compressed latent representations of complex, often high-dimensional, data. In this paper, we derive an alternative variational lower bound from the one common in VAEs, which aims to minimize aggregate information loss. Using our lower bo…

2019-02-16abs ↗pdf ↗

Let GG be an almost simple, simply connected algebraic group defined over a number field kk, and let SS be a finite set of places of kk including all infinite places. Let XX be the product over vSv\in S of the symmetric spaces associated to G(kv)G(k_v), when vv is an infinite place, and the Bruhat-Tits buildings ass…

2011-06-23abs ↗pdf ↗

Study identifies latent variables and causal relationships from multiple environments.

problem Identify latent variables and causal relationships from multiple environments.
method Proposes algorithm LiNGCReL for identifying causal graph up to surrounded-node ambiguity.
result Identifies latent variables up to surrounded-node ambiguity (SNA) in linear causal models.