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

173347520693 · Jun 202019922001200920172026
48 results for situated work

In this work it is presented some considerations about entrepreneurship. Most of these questions are linked with Portuguese context. Portugal has some particularities, namely because the asymmetries between the littoral and the interior. This situation carried out some problems that complicate and prevent the appearanc…

2011-10-25abs ↗pdf ↗

The paper examines sizing strategies for algorithmic trading in volatile markets.

problem High volatility creates challenges for algorithmic traders.
method Investigates different sizing models and backtesting techniques for financial trading.
result Sizing models can lower Value at Risk (VaR) during crisis events.

A continuous-time consumption-investment model with constraint is considered for a small investor whose decisions are the consumption rate and the allocation of wealth to a risk-free and a risky asset with logarithmic Brownian motion fluctuations. The consumption rate is subject to an upper bound constraint which linea…

2014-04-30abs ↗pdf ↗

Increasing urban concentration raises operational challenges that can benefit from integrated monitoring and decision support. Such complex systems need to leverage the full stack of analytical methods, from state estimation using multi-sensor fusion for situational awareness, to prediction and computation of optimal r…

2019-05-14abs ↗pdf ↗

This paper describes a time-series-based classification approach to identify similarities between bio-medical-based situations. The proposed approach allows classifying collections of time-series representing bio-medical measurements, i.e., situations, regardless of the type, the length and the quantity of the time-ser…

2013-03-01abs ↗pdf ↗

The paper provides generalization bounds for metric learning using neural network embeddings.

problem Generalization guarantees for metric learning with neural network embeddings.
method Uniform generalization bounds for two regimes: sparse and bounded amplification.
result Dimension-free generalization bounds can be achieved even without sparsity in solutions.

This work tackles catastrophic forgetting in neural networks by mimicking brain's metaplasticity.

problem Catastrophic forgetting in neural networks, where new tasks erase previously learned ones.
method Interpreting binarized neural networks as metaplastic systems, adjusting their training technique.
result Training technique reduces catastrophic forgetting without needing previously presented data.

Recently the authors have explored new concepts of plurisubharmonicity and pseudoconvexity, with much of the attendant analysis, in the context of calibrated manifolds. Here a much broader extension is made. This development covers a wide variety of geometric situations, including, for example, Lagrangian plurisubhamon…

2008-04-08abs ↗pdf ↗

We study a policy gradient method with L2 regularization for MAB problems.

problem Improving policy gradient methods for MAB problems with regularization.
method Investigate convergence of a policy gradient algorithm with L2 regularization for MAB.
result Prove convergence under appropriate technical hypotheses and show practical improvements.

Machine-learning driven safety-critical autonomous systems, such as self-driving cars, must be able to detect situations where its trained model is not able to make a trustworthy prediction. Often viewed as a black-box, it is non-obvious to determine when a model will make a safe decision and when it will make an erron…

2019-06-09abs ↗pdf ↗

Our goal is to build robust optimization problems for making decisions based on complex data from the past. In robust optimization (RO) generally, the goal is to create a policy for decision-making that is robust to our uncertainty about the future. In particular, we want our policy to best handle the the worst possibl…

2014-07-04abs ↗pdf ↗

Counterfactual policy evaluation improves autonomous driving policies' generalization.

problem Learnt policies often fail to generalize and handle novel situations.
method Introduces counterfactual policy evaluation using counterfactual worlds.
result Significantly decreases collision-rate while maintaining high success-rate.

The paper explores maximal destabilizers for both K-stability and Chow-stability in unstable situations.

problem Exploring maximal destabilizers for K-stability and Chow-stability in unstable situations.
method Using non-Archimedean pluripotential theory and idealistic assumptions, the paper provides a route to show that maximal K-destabilizers are quantized by maximal Chow-destabilizers.
result Maximal K-destabilizers are quantized by maximal Chow-destabilizers.

In this paper we try to design the necessary calculation needed for backtesting trading systems when only candle chart data are available. We lay particular emphasis on situations which are not or not uniquely decidable and give possible strategies to handle such situations.

2014-12-17abs ↗pdf ↗

In various situations in Floer theory, one extracts homological invariants from "Morse-Bott" data in which the "critical set" is a union of manifolds, and the moduli spaces of "flow lines" have evaluation maps taking values in the critical set. This requires a mix of analytic arguments (establishing properties of the m…

2017-11-27abs ↗pdf ↗

CST detects discrimination by comparing protected and non-protected individuals with a counterfactual.

problem Detecting discrimination in classifiers using legal fairness conditions.
method Operationalizes fairness given the difference using counterfactual reasoning.
result CST uncovers more discrimination cases than traditional situation testing.

We give several generalizations of the Kodaira vanishing and embedding theorems for Kähler manifolds to the case where the relevent line bundle has a small region of negative curvature. To prove the vanishing theorems we adapt techniques of Elworthy-Rosenberg for vanishing theorems in Riemannian geometry. For the embed…

1995-02-02abs ↗pdf ↗

This work addresses various open questions in the theory of active learning for nonparametric classification. Our contributions are both statistical and algorithmic: -We establish new minimax-rates for active learning under common \textit{noise conditions}. These rates display interesting transitions -- due to the inte…

2017-03-16abs ↗pdf ↗

In the present paper, using a replica analysis, we examine the portfolio optimization problem handled in previous work and discuss the minimization of investment risk under constraints of budget and expected return for the case that the distribution of the hyperparameters of the mean and variance of the return rate of …

2017-03-08abs ↗pdf ↗