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

Trend · papers per month

2356 · Oct 202019922001200920172026
48 results for time-use diaries

Generative model predicts daily activity sequences with duration-aware dynamics.

problem Accurately forecasting granular daily activity sequences for energy demand.
method Hierarchical semi-Markov models with duration-aware dynamics.
result Explicitly modeling activity durations improves predictive performance.

To study users' travel behaviour and travel time between origin and destination, researchers employ travel surveys. Although there is consensus in the field about the potential, after over ten years of research and field experimentation, Smartphone-based travel surveys still did not take off to a large scale. Here, com…

2019-12-24abs ↗pdf ↗

Learning with Label Proportions (LLP) is the problem of recovering the underlying true labels given a dataset when the data is presented in the form of bags. This paradigm is particularly suitable in contexts where providing individual labels is expensive and label aggregates are more easily obtained. In the healthcare…

2018-10-24abs ↗pdf ↗

Spatio-temporal point process models play a central role in the analysis of spatially distributed systems in several disciplines. Yet, scalable inference remains computa- tionally challenging both due to the high resolution modelling generally required and the analytically intractable likelihood function. Here, we expl…

2013-05-17abs ↗pdf ↗

We adress the maximization problem of expected utility from terminal wealth. The special feature of this paper is that we consider a financial market where the price process of risky assets can have a default time. Using dynamic programming, we characterize the value function with a backward stochastic differential equ…

2008-11-28abs ↗pdf ↗

The paper analyzes risk assessment for cash flows in continuous time using the notion of convex risk measures for processes. By combining a decomposition result for optional measures, and a dual representation of a convex risk measure for bounded \cd processes, we show that this framework provides a systematic approach…

2013-04-17abs ↗pdf ↗

To improve the efficient frontier of the classical mean-variance model in continuous time, we propose a varying terminal time mean-variance model with a constraint on the mean value of the portfolio asset, which moves with the varying terminal time. Using the embedding technique from stochastic optimal control in conti…

2019-09-28abs ↗pdf ↗

The waggle dance that honeybees perform is an astonishing way of communicating the location of food source. After over 60 years of its discovery, researchers still use manual labeling by watching hours of dance videos to detect different transitions between dance components thus extracting information regarding the dis…

2017-05-20abs ↗pdf ↗

Population synthesis is concerned with the generation of synthetic yet realistic representations of populations. It is a fundamental problem in the modeling of transport where the synthetic populations of micro-agents represent a key input to most agent-based models. In this paper, a new methodological framework for ho…

2018-08-21abs ↗pdf ↗

Study neck pinches in Lagrangian flows, proving stability and introducing new singularities.

problem Understanding neck pinches in Lagrangian flows.
method Introduced nondegenerate neck pinch and teardrop singularities, proving stability and answering questions.
result Nondegenerate neck pinches are stable and can be perturbed to nondegenerate singularities.

Machine learning models are often used at test-time subject to constraints and trade-offs not present at training-time. For example, a computer vision model operating on an embedded device may need to perform real-time inference, or a translation model operating on a cell phone may wish to bound its average compute tim…

2017-02-24abs ↗pdf ↗

Time series with non-uniform intervals occur in many applications, and are difficult to model using standard recurrent neural networks (RNNs). We generalize RNNs to have continuous-time hidden dynamics defined by ordinary differential equations (ODEs), a model we call ODE-RNNs. Furthermore, we use ODE-RNNs to replace t…

2019-07-08abs ↗pdf ↗

We introduce an efficient method for training the linear ranking support vector machine. The method combines cutting plane optimization with red-black tree based approach to subgradient calculations, and has O(m*s+m*log(m)) time complexity, where m is the number of training examples, and s the average number of non-zer…

2010-05-06abs ↗pdf ↗

We present a global construction of a so-called D-bracket appearing in the physics literature of Double Field Theory (DFT) and show that if certain integrability criteria are satisfied, it can be seen as a sum of two Courant algebroid brackets. In particular, we show that the local picture of the extended space-time us…

2018-02-22abs ↗pdf ↗

The instability of historical risk factor correlations renders their use in estimating portfolio risk extremely questionable. In periods of market stress correlations of risk factors have a tendency to quickly go well beyond estimated values. For instance, in times of severe market stress, one would expect with certain…

2001-08-14abs ↗pdf ↗

Firms having similar business activities are correlated. We analyze two different cross-correlation matrices C constructed from (i) 30-min price fluctuations of 1000 US stocks for the 2-year period 1994-95 and (ii) 1-day price fluctuations of 422 US stocks for the 35-year period 1962-96. We find that the eigenvectors o…

2000-11-08abs ↗pdf ↗

This paper explores the capabilities of convolutional neural networks to deal with a task that is easily manageable for humans: perceiving 3D pose of a human body from varying angles. However, in our approach, we are restricted to using a monocular vision system. For this purpose, we apply a convolutional neural networ…

2016-08-31abs ↗pdf ↗

Our goal here is to discuss the pricing problem of European and American options in discrete time using elementary calculus so as to be an easy reference for first year undergraduate students. Using the binomial model we compute the fair price of European and American options. We explain the notion of Arbitrage and the…

2015-10-20abs ↗pdf ↗

This work evaluates risks over time using robust measures and neural networks.

problem Distributionally robust risk evaluation over temporal data.
method Characterizes alternative measures using causal optimal transport, approximates test functions by neural networks, and proves sample complexity.
result Framework outperforms classic counterparts in portfolio selection problems.

We study a symplectic surgery operation we call unchaining, which effectively reduces the second Betti number and the symplectic Kodaira dimension at the same time. Using unchaining, we give novel constructions of symplectic Calabi-Yau surfaces from complex surfaces of general type, as well as from rational and ruled s…

2019-03-07abs ↗pdf ↗

This is an introductory chapter in a series in which we take a systematic study of the Yang-Mills equations on curved space-times. In this first, we provide standard material that consists in writing the proof of the global existence of Yang-Mills fields on arbitrary curved space-times using the Klainerman-Rodnianski p…

2013-12-19abs ↗pdf ↗

In the present work, it is shown that, the application of the Bazanski approach to Lagrangians, written in AP-geometry and including the basic vector of the space, gives rise to a new class of path equations. The general equation representing this class contains four extra terms, whose vanishing reduces this equation t…

2004-08-11abs ↗pdf ↗

MPC outperforms reactive budgeting in non-stationary return environments.

problem Optimizing budget allocation under non-stationary returns.
method Receding-horizon Model Predictive Control (MPC) compared to reactive policies.
result MPC consistently outperforms reactive budgeting when return dynamics are predictable.

Generative model prices basket options efficiently.

problem Real-time pricing of basket options with varying market inputs.
method Truncated path signatures and Mixture Density Networks (MDN) for learning the terminal density.
result The model produces small pricing errors and matches Monte Carlo simulations closely.

Sparse reconstruction approaches using the re-weighted l1-penalty have been shown, both empirically and theoretically, to provide a significant improvement in recovering sparse signals in comparison to the l1-relaxation. However, numerical optimization of such penalties involves solving problems with l1-norms in the ob…

2013-12-05abs ↗pdf ↗

Detecting faults and SLA violations in a timely manner is critical for telecom providers, in order to avoid loss in business, revenue and reputation. At the same time predicting SLA violations for user services in telecom environments is difficult, due to time-varying user demands and infrastructure load conditions. In…

2015-09-04abs ↗pdf ↗