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.
Social sensing has emerged as a new sensing paradigm where humans (or devices on their behalf) collectively report measurements about the physical world. This paper focuses on a quality-cost-aware task allocation problem in multi-attribute social sensing applications. The goal is to identify a task allocation strategy …
In this paper, we provide a representation theorem for dynamic capital allocation under It{ô}-L{é}vy model. We consider the representation of dynamic risk measures defined under Backward Stochastic Differential Equations (BSDE) with generators that grow quadratic-exponentially in the control variables. Dynamic capital …
Optimal asset allocation is a key topic in modern finance theory. To realize the optimal asset allocation on investor's risk aversion, various portfolio construction methods have been proposed. Recently, the applications of machine learning are rapidly growing in the area of finance. In this article, we propose the Stu…
This paper proposes a novel learning method for multi-task applications. Multi-task neural networks can learn to transfer knowledge across different tasks by using parameter sharing. However, sharing parameters between unrelated tasks can hurt performance. To address this issue, we propose a framework to learn fine-gra…
In latent Dirichlet allocation (LDA), topics are multinomial distributions over the entire vocabulary. However, the vocabulary usually contains many words that are not relevant in forming the topics. We adopt a variable selection method widely used in statistical modeling as a dimension reduction tool and combine it wi…
This paper considers the design of optimal resource allocation policies in wireless communication systems which are generically modeled as a functional optimization problem with stochastic constraints. These optimization problems have the structure of a learning problem in which the statistical loss appears as a constr…
Optimizes resource allocation for distributed parameter estimation in sensor networks.
problem Maximizing accuracy in parameter estimation with limited resources.
method Formulates a data collection and collaboration policy design problem as a Fisher information maximization problem. Proposes multi-armed bandit algorithms for learning the optimal policy.
result Identifies optimal data collection and collaboration policies that balance resource use and estimation accuracy.
The latent Dirichlet allocation (LDA) model is a widely-used latent variable model in machine learning for text analysis. Inference for this model typically involves a single-site collapsed Gibbs sampling step for latent variables associated with observations. The efficiency of the sampling is critical to the success o…
This work develops a novel power control framework for energy-efficient power control in wireless networks. The proposed method is a new branch-and-bound procedure based on problem-specific bounds for energy-efficiency maximization that allow for faster convergence. This enables to find the global solution for all of t…
We present a simulation-and-regression method for solving dynamic portfolio allocation problems in the presence of general transaction costs, liquidity costs and market impacts. This method extends the classical least squares Monte Carlo algorithm to incorporate switching costs, corresponding to transaction costs and t…
A classical portfolio theory deals with finding the optimal proportion in which an agent invests a wealth in a risk-free asset and a probabilistic risky asset. Formulating and solving the problem depend on how the risk is represented and how, combined with the utility function defines a notion of expected utility. In t…
Financial institutions have to allocate so-called "economic capital" in order to guarantee solvency to their clients and counter parties. Mathematically speaking, any methodology of allocating capital is a "risk measure", i.e. a function mapping random variables to the real numbers. Nowadays "value-at-risk", which is d…
We study parameter inference in large-scale latent variable models. We first propose an unified treatment of online inference for latent variable models from a non-canonical exponential family, and draw explicit links between several previously proposed frequentist or Bayesian methods. We then propose a novel inference…
We present a hybrid algorithm for Bayesian topic models that combines the efficiency of sparse Gibbs sampling with the scalability of online stochastic inference. We used our algorithm to analyze a corpus of 1.2 million books (33 billion words) with thousands of topics. Our approach reduces the bias of variational infe…
The article uses dynamic factor allocation to improve portfolio performance by integrating regime-switching signals.
problem Improving portfolio performance through dynamic factor allocation.
method The authors apply the sparse jump model (SJM) to identify bull and bear market regimes for individual factors, then fine-tune hyperparameters using a hypothetical single-factor long-short strategy. These regime inferences are incorporated into the Black-Litterman framework to dynamically adjust allocations among indices.
result The constructed multi-factor portfolio significantly improves the information ratio (IR) relative to the market, raising it from 0.05 to approximately 0.4.
The paper introduces new portfolio rules beyond mean-variance, addressing asymmetry and uncertainty.
problem Optimizing portfolios with asymmetric returns and uncertainty in expected returns.
method Derives allocation rules for asymmetric Laplace distributed returns and random normal expected returns. Addresses singular covariance matrices and uncertainty in returns.
result Optimal worst-case scenario solution provides a convex alternative to risk parity, improving portfolio stability.
A refinement of Bennett's inequality is introduced which is strictly tighter than the classical bound. The new bound establishes the convergence of the average of independent random variables to its expected value. It also carefully exploits information about the potentially heterogeneous mean, variance, and ceiling of…
It is well known that quantile regression model minimizes the portfolio extreme risk, whenever the attention is placed on the estimation of the response variable left quantiles. We show that, by considering the entire conditional distribution of the dependent variable, it is possible to optimize different risk and perf…
In this paper we propose a computationally efficient algorithm for on-line variable selection in multivariate regression problems involving high dimensional data streams. The algorithm recursively extracts all the latent factors of a partial least squares solution and selects the most important variables for each facto…
It is challenging to develop stochastic gradient based scalable inference for deep discrete latent variable models (LVMs), due to the difficulties in not only computing the gradients, but also adapting the step sizes to different latent factors and hidden layers. For the Poisson gamma belief network (PGBN), a recently …