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.
Spectral Clustering as a relaxation of the normalized/ratio cut has become one of the standard graph-based clustering methods. Existing methods for the computation of multiple clusters, corresponding to a balanced k-cut of the graph, are either based on greedy techniques or heuristics which have weak connection to th…
We study Smoothed Online Convex Optimization, a version of online convex optimization where the learner incurs a penalty for changing her actions between rounds. Given a Ω(d) lower bound on the competitive ratio of any online algorithm, where d is the dimension of the action space, we ask under what conditio…
In real-world classification problems, the class balance in the training dataset does not necessarily reflect that of the test dataset, which can cause significant estimation bias. If the class ratio of the test dataset is known, instance re-weighting or resampling allows systematical bias correction. However, learning…
We study online convex optimization in a setting where the learner seeks to minimize the sum of a per-round hitting cost and a movement cost which is incurred when changing decisions between rounds. We prove a new lower bound on the competitive ratio of any online algorithm in the setting where the costs are m-strong…
Decision trees algorithms use a gain function to select the best split during the tree's induction. This function is crucial to obtain trees with high predictive accuracy. Some gain functions can suffer from a bias when it compares splits of different arities. Quinlan proposed a gain ratio in C4.5's information gain fu…
This article contains the first published example of a real economic balance sheet where the Solvency II ratio substantially depends on the seed selected for the random number generator (RNG) used. The theoretical background and the main quality criteria for RNGs are explained in detail. To serve as a gauge for RNGs, a…
Neurons and networks in the cerebral cortex must operate reliably despite multiple sources of noise. To evaluate the impact of both input and output noise, we determine the robustness of single-neuron stimulus selective responses, as well as the robustness of attractor states of networks of neurons performing memory ta…
We investigate the dynamical behavior in the large scale region of non-equilibrium systems, by employing data on the assessed value of land in 1983 -- 2006 Japan. In the system we find the detailed quasi-balance, which has the symmetry: x_1 -> a {x_2}^θ (x_1 and x_2 are two successive land prices). By using the detaile…
Optimal reinsurance when Value at Risk and expected surplus is balanced through their ratio is studied, and it is demonstrated how results for risk-adjusted surplus can be utilized. Simplifications for large portfolios are derived, and this large-portfolio study suggests a new condition on the reinsurance pricing regim…
In many important machine learning applications, the training distribution used to learn a probabilistic classifier differs from the testing distribution on which the classifier will be used to make predictions. Traditional methods correct the distribution shift by reweighting the training data with the ratio of the de…
Q-learning is a simple and powerful tool in solving dynamic problems where environments are unknown. It uses a balance of exploration and exploitation to find an optimal solution to the problem. In this paper, we propose using four basic emotions: joy, sadness, fear, and anger to influence a Qlearning agent. Simulation…
We prove that the Kontsevich tetrahedral flow P˙=Qa:b(P), the right-hand side of which is a linear combination of two differential monomials of degree four in a bi-vector P on an affine real Poisson manifold Nn, does infinitesimally preserve the space of Poisson…
We study a general problem of allocating limited resources to heterogeneous customers over time under model uncertainty. Each type of customer can be serviced using different actions, each of which stochastically consumes some combination of resources, and returns different rewards for the resources consumed. We consid…
Deep generative models can learn to generate realistic-looking images, but many of the most effective methods are adversarial and involve a saddlepoint optimization, which requires a careful balancing of training between a generator network and a critic network. Maximum mean discrepancy networks (MMD-nets) avoid this i…