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.

169,051 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Jun 199319922001200920172026
48 results for occupation times

The paper defines and analyzes Poissonian occupation times for negative Lévy processes.

problem Analyzing the time spent below zero for Lévy processes with interruptions.
method Introduces Poissonian occupation times for spectrally negative Lévy processes.
result Extends results on continuous observation to interrupted observation.

We find the optimal investment strategy to minimize the expected time that an individual's wealth stays below zero, the so-called {\it occupation time}. The individual consumes at a constant rate and invests in a Black-Scholes financial market consisting of one riskless and one risky asset, with the risky asset's price…

2008-05-26abs ↗pdf ↗

D2SRM solves complex PDEs using deep learning.

problem High-dimensional, Hessian-dependent fully nonlinear parabolic PDEs.
method Single scalar space-time network generating derivative-consistent approximations trained through residuals and penalties.
result Well-posedness and convergence theory established for globally Lipschitz equations.

Spacematch matches office workers with suitable workspaces based on their preferences.

problem Matching workers with suitable workspaces in ABW environments.
method Developed a web-based mobile app to collect occupant preferences and IoT sensors for real-time environmental feedback.
result Occupant preferences can be segmented and matched to build a recommendation platform.

Method reduces bias in occupation classification without protected attribute data.

problem Mitigating bias in occupation classification without access to protected attributes.
method Uses word embeddings to discourage correlation between predicted occupation probability and name.
result Reduces race and gender biases without significant loss in true positive rate.

A new method learns continuous occupancy fields efficiently using the Ising model.

problem Efficiently learning continuous occupancy fields for robot navigation.
method Generalizes the Ising model to model continuous occupancy fields, using a unique kernel for range measurements.
result The method is computationally efficient and requires only a small number of hyperparameters.

The paper learns personalized thermal preferences using Bayesian active learning.

problem Learning personalized thermal preferences from occupant feedback.
method Bayesian active learning with unimodality constraints on Gaussian process.
result The method requires fewer observations to learn optimal temperature preferences.

Study measures gender bias in machine translation using multiple reference points.

problem Measuring and identifying gender bias in machine translation.
method Used an optimal non-biased translator, reference points from occupational statistics and survey.
result Found bias against both genders, but more against women, and found occupations have a greater effect than adjectives.

GANs improve building performance model accuracy by integrating occupant behaviors.

problem Discrepancies between design and operation performance in buildings.
method Generative Adversarial Networks (GANs) to learn mixture models combining existing BPMs with occupant behaviors.
result Augmented BPMs significantly outperform existing BPMs in achieving specified performance targets.

Digital tools may hinder or facilitate multidisciplinary collaboration in occupational health.

problem Challenges in multidisciplinary collaboration in occupational health.
method Study of a precursor SPSTI's digital tools and their impacts.
result Digital tools can act as both brakes and levers for multidisciplinary dynamics.

A new method estimates SDEs using occupation kernels.

problem Learning multivariate stochastic differential equations (SDEs).
method Two-step procedure: estimate drift, then diffusion. Occupation kernels used in RKHS.
result Validated on simulated and real-world data.

We introduce cylindrical projections to simulate infinite-dimensional occupation flows of diffusions.

problem Computational intractability of infinite-dimensional occupation flows of diffusions.
method Introduce cylindrical projections to approximate the occupation flow via a finite-dimensional system.
result Strong convergence of cylindrical projections to the initial process with derived rates.

Investment strategies in occupational pension plans are optimized for non-tradable income risk.

problem Optimizing investment strategies for occupational pension plans in the presence of non-tradable income risk.
method Formulated as a stochastic optimization problem, analyzed in both constant and stochastic volatility environments.
result Random contributions induce the optimal glide path structure, influenced by initial wealth, contributions, and risk aversion.

Using integration by parts on Gaussian space we construct a Stein Unbiased Risk Estimator (SURE) for the drift of Gaussian processes using their local and occupation times. By almost-sure minimization of the SURE risk of shrinkage estimators we derive an estimation and de-noising procedure for an input signal perturbed…

2008-09-09abs ↗pdf ↗

Paper tackles dynamic pricing in a geometrically decaying environment, achieving better occupancy with lower rates.

problem Minimizing expected loss in a dynamically changing environment with decisions dependent on the data distribution.
method Introduces algorithms for information and loss function settings, using repeated decision deployment to allow mixing of the environment.
result Iteration complexity matches first and zero order stochastic gradient methods up to logarithmic factors.

Conditional Asian options are recent market innovations, which offer cheaper and long-dated alternatives to regular Asian options. In contrast with payoffs from regular Asian options which are based on average asset prices, the payoffs from conditional Asian options are determined only by average prices above certain t…

2015-05-26abs ↗pdf ↗

Proposes a game-theoretic framework to motivate energy-efficient behavior in smart buildings.

problem Improving energy efficiency in smart building infrastructure through occupant behavior.
method Introduces a novel game-theoretic framework with human interaction, incorporating utility learning and deep neural networks.
result Demonstrates highly accurate prediction of occupant energy resource usage and explainable decision-making.

We consider the problem of robustly maximizing the growth rate of investor wealth in the presence of model uncertainty. Possible models are all those under which the assets' region EE and instantaneous covariation cc are known, and where additionally the assets are stable in that their occupancy time measures converg…

2018-01-19abs ↗pdf ↗

DFKI Cabin Simulator tests visual monitoring functions in vehicles.

problem Validating novel human-vehicle interfaces and driver assistance systems.
method Driving simulator with in-cabin mock-up and camera system.
result Validation of in-cabin monitoring functions for advanced driver assistance and automated driving.

Occupant behavior (OB) and in particular window openings need to be considered in building performance simulation (BPS), in order to realistically model the indoor climate and energy consumption for heating ventilation and air conditioning (HVAC). However, the proposed OB window opening models are often biased towards …

2018-07-10abs ↗pdf ↗

Paper uses Sinkhorn distances to improve imitation learning effectiveness.

problem Improving imitation learning algorithms by comparing occupancy measures.
method Formulates imitation learning as Sinkhorn distance minimization, combining optimal transport and cosine distances.
result Proposes a new critic network and transport plan that guide imitation learning.

HCNAF models complex conditional distributions for probabilistic occupancy forecasting.

problem Modeling complex conditional probability density functions for occupancy forecasting.
method Hyper-Conditioned Neural Autoregressive Flow (HCNAF) combining AF and hyper-network.
result HCNAF achieves state-of-the-art performance in self-driving datasets.

This work explores efficient reinforcement learning with density features in low-rank MDPs.

problem Efficient reinforcement learning with density features in low-rank MDPs.
method Proposes algorithms for off-policy estimation and online construction of exploratory data distributions.
result Demonstrates sample-efficient learning with density features in low-rank MDPs, overcoming technical challenges.

MOCK learns complex systems from trajectories efficiently.

problem Learning nonparametric differential equations from high-dimensional data.
method MOCK uses multivariate occupation kernel functions to learn vector fields linearly.
result MOCK outperforms other methods on various datasets.

We consider a special family of occupation-time derivatives, namely proportional step options introduced by Linetsky in [Math. Finance, 9, 55--96 (1999)]. We develop new closed-form spectral expansions for pricing such options under a class of nonlinear volatility diffusion processes which includes the constant-elastic…

2013-02-15abs ↗pdf ↗

Study shows visual feedback and monetary incentives reduce plugload energy consumption in commercial buildings.

problem Mitigating energy consumption in commercial buildings through occupant plugload control.
method Field experiments with visual feedback and monetary incentives in government and university buildings.
result Mean energy reduction of ~9.52% in office environments and ~21.61% in university environments with visual feedback.

Algorithm speeds up search for stationary targets with guaranteed accuracy.

problem Minimize search time while ensuring high detection accuracy of stationary targets.
method Multi-fidelity Gaussian process model and EMTS algorithm.
result Guaranteed performance in target detection accuracy and search time.

We address the problem of finding an optimal policy in a Markov decision process under a restricted policy class defined by the convex hull of a set of base policies. This problem is of great interest in applications in which a number of reasonably good (or safe) policies are already known and we are only interested in…

2018-02-26abs ↗pdf ↗