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.
This paper studies the Glosten Milgrom model whose risky asset value admits an arbitrary discrete distribution. Contrast to existing results on insider's models, the insider's optimal strategy in this model, if exists, is not of feedback type. Therefore a weak formulation of equilibrium is proposed. In this weak formul…
New graph feedback model for bandits with improved regret bounds.
problem Understanding how graph structure affects regret in bandit problems.
method Introduced fractional weak domination number and k-packing independence number to capture upper and lower bounds on regret. Used strong duality theorem to derive upper and lower bounds.
result Proved general upper and lower bounds on regret for various graph structures, showing tightness up to a logarithmic factor.
This paper extends a Kyle model to include price-responsive traders, revealing new dynamics and equilibria.
problem Real-world market dynamics involve price-responsive traders, affecting market equilibrium and insider profits.
method Developed a continuous-time Kyle model with two types of price-responsive traders (momentum and contrarian), leading to a forward-backward Riccati system for equilibrium.
result The model shows that feedback effects can lead to multiple equilibria and amplify price informativeness.
We explore whether useful temporal neural generative models can be learned from sequential data without back-propagation through time. We investigate the viability of a more neurocognitively-grounded approach in the context of unsupervised generative modeling of sequences. Specifically, we build on the concept of predi…
Learning the right graph representation from noisy, multisource data has garnered significant interest in recent years. A central tenet of this problem is relational learning. Here the objective is to incorporate the partial information each data source gives us in a way that captures the true underlying relationships.…
We decompose, within an ARCH framework, the daily volatility of stocks into overnight and intra-day contributions. We find, as perhaps expected, that the overnight and intra-day returns behave completely differently. For example, while past intra-day returns affect equally the future intra-day and overnight volatilitie…
There is increasing interest in learning algorithms that involve interaction between human and machine. Comparison-based queries are among the most natural ways to get feedback from humans. A challenge in designing comparison-based interactive learning algorithms is coping with noisy answers. The most common fix is to …
A challenge in training discriminative models like neural networks is obtaining enough labeled training data. Recent approaches use generative models to combine weak supervision sources, like user-defined heuristics or knowledge bases, to label training data. Prior work has explored learning accuracies for these source…
We propose a method to build quantum memristors in quantum photonic platforms. We firstly design an effective beam splitter, which is tunable in real-time, by means of a Mach-Zehnder-type array with two equal 50:50 beam splitters and a tunable retarder, which allows us to control its reflectivity. Then, we show that th…
Financial system being the place of metting capital flows (equality between saving and investment), a volatility of capital flows can destroy the robustness and good working of financial system, it means subvert financial stability. The same a weak financial system, few regulated and bad manage can exacerbate volatilit…
We introduce and describe the results of a novel shared task on bandit learning for machine translation. The task was organized jointly by Amazon and Heidelberg University for the first time at the Second Conference on Machine Translation (WMT 2017). The goal of the task is to encourage research on learning machine tra…
New method learns from either positive or negative feedback alone.
problem Limited applicability of existing preference optimization methods in scenarios with only unpaired feedback.
method Decouples learning from positive and negative feedback, using expectation-maximization (EM) to optimize probability of positive outcomes and explicitly incorporate negative examples.
result Stable learning from negative feedback alone demonstrated.
Previous analyses of a large ensemble of stock markets have demonstrated that a log-periodic power law (LPPL) behavior of the prices constitutes a qualifying signature of speculative bubbles that often land with a crash. We detect such a LPPL signature in the foreign capital inflow during the bubble on the US markets c…
User preferences for items can be inferred from either explicit feedback, such as item ratings, or implicit feedback, such as rental histories. Research in collaborative filtering has concentrated on explicit feedback, resulting in the development of accurate and scalable models. However, since explicit feedback is oft…