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.
Optimizes stock portfolios with a constraint on correlation to reduce risk.
The paper tackles fair correlation clustering with new algorithms and analysis.
Detects causal scenarios with inequality constraints among classical correlations.
New method relaxes PCA orthogonality constraints using explained variance of correlated components.
We consider the problem of minimizing capital at risk in the Black-Scholes setting. The portfolio problem is studied given the possibility that a correlation constraint between the portfolio and a financial index is imposed. The optimal portfolio is obtained in closed form. The effects of the correlation constraint are…
Exact simulation of correlated binary outcomes using PMF constraints and linear programming.
In this work, we consider the optimal portfolio selection problem under hard constraints on trading amounts, transaction costs and different rates for borrowing and lending when the risky asset returns are serially correlated. No assumptions about the correlation structure between different time points or about the dis…
The paper tackles fair correlation clustering with fairness constraints.
Canonical correlation analysis was proposed by Hotelling [6] and it measures linear relationship between two multidimensional variables. In high dimensional setting, the classical canonical correlation analysis breaks down. We propose a sparse canonical correlation analysis by adding l1 constraints on the canonical vec…
Study on collaboration vs. independent data collection in sensor networks.
Correlations between asset returns are important in many financial applications. In recent years, multivariate volatility models have been used to describe the time-varying feature of the correlations. However, the curse of dimensionality quickly becomes an issue as the number of correlations is for asse…
Unsupervised two-view learning, or detection of dependencies between two paired data sets, is typically done by some variant of canonical correlation analysis (CCA). CCA searches for a linear projection for each view, such that the correlations between the projections are maximized. The solution is invariant to any lin…
In this paper, we formulate the Canonical Correlation Analysis (CCA) problem on matrix manifolds. This framework provides a natural way for dealing with matrix constraints and tools for building efficient algorithms even in an adaptive setting. Finally, an adaptive CCA algorithm is proposed and applied to a change dete…
One primary focus in multimodal feature extraction is to find the representations of individual modalities that are maximally correlated. As a well-known measure of dependence, the Hirschfeld-Gebelein-Rényi (HGR) maximal correlation becomes an appealing objective because of its operational meaning and desirable propert…
There are a multitude of methods to perform multi-set correlated component analysis (MCCA), including some that require iterative solutions. The methods differ on the criterion they optimize and the constraints placed on the solutions. This note focuses perhaps on the simplest version, which can be solved in a single s…
New DP methods for estimating means and frequencies with varying privacy demands.
The paper finds a surprising positive correlation between upstreamness and downstreamness in global value chains.
In the era of big data, reducing data dimensionality is critical in many areas of science. Widely used Principal Component Analysis (PCA) addresses this problem by computing a low dimensional data embedding that maximally explain variance of the data. However, PCA has two major weaknesses. Firstly, it only considers li…
Optimizing rewards under budget constraints with correlated costs and rewards.
Study financial market graphs with Laplacian constraints.
Optimal wind farm placement using quantile constraints for better power output.
Automates model selection for GLMs using optimization.
A new model for multiview data analysis using graph autoencoders.
New method finds linear relationships across multiple data blocks using proximal gradient descent with constraint.
VCAE improves autoencoder quality on MNIST and CelebA.
Develops methods to learn correlation potentials for time-dependent Kohn-Sham systems.
Paper relaxes differential privacy for correlated features, improving privacy-utility trade-off.
Neural networks are increasingly used in complex (data-driven) simulations as surrogates or for accelerating the computation of classical surrogates. In many applications physical constraints, such as mass or energy conservation, must be satisfied to obtain reliable results. However, standard machine learning algorithm…
Maximal correlation framework improves fairness in machine learning algorithms.
Proposes rounding method for precise treatment effect estimation under budget constraints.
Sparse GCA finds linear relationships in multiple datasets, using gradient descent.
The paper analyzes Nordic stock markets' correlation structures and regime shifts.
We address the problem of likelihood based inference for correlated diffusion processes using Markov chain Monte Carlo (MCMC) techniques. Such a task presents two interesting problems. First, the construction of the MCMC scheme should ensure that the correlation coefficients are updated subject to the positive definite…
Correlation filters (CFs) are a class of classifiers that are attractive for object localization and tracking applications. Traditionally, CFs have been designed in the frequency domain using the discrete Fourier transform (DFT), where correlation is efficiently implemented. However, existing CF designs do not account …
Paper tackles group robustness with partially labeled data.
Learning high-quality node embeddings is a key building block for machine learning models that operate on graph data, such as social networks and recommender systems. However, existing graph embedding techniques are unable to cope with fairness constraints, e.g., ensuring that the learned representations do not correla…
Active learning optimizes correlation clustering by querying the most informative pairwise comparisons.
Non-negative matrix factorization is a basic tool for decomposing data into the feature and weight matrices under non-negativity constraints, and in practice is often solved in the alternating minimization framework. However, it is unclear whether such algorithms can recover the ground-truth feature matrix when the wei…
We investigate the fundamental principles that drive the development of scalable algorithms for network optimization. Despite the significant amount of work on parallel and decentralized algorithms in the optimization community, the methods that have been proposed typically rely on strict separability assumptions for o…
We show that many machine learning goals, such as improved fairness metrics, can be expressed as constraints on the model's predictions, which we call rate constraints. We study the problem of training non-convex models subject to these rate constraints (or any non-convex and non-differentiable constraints). In the non…
The dynamic network of relationships among corporations underlies cascading economic failures including the current economic crisis, and can be inferred from correlations in market value fluctuations. We analyze the time dependence of the network of correlations to reveal the changing relationships among the financial,…
Voltage control plays an important role in the operation of electricity distribution networks, especially with high penetration of distributed energy resources. These resources introduce significant and fast varying uncertainties. In this paper, we focus on reactive power compensation to control voltage in the presence…
cCBO optimizes interventions in causal graphs under constraints.
Multi-view spectral clustering, which aims at yielding an agreement or consensus data objects grouping across multi-views with their graph laplacian matrices, is a fundamental clustering problem. Among the existing methods, Low-Rank Representation (LRR) based method is quite superior in terms of its effectiveness, intu…
Decomposes bias in linear models under demographic parity constraints.
In the paper, a mean-square minimization problem under terminal wealth constraint with partial observations is studied. The problem is naturally connected to the mean-variance hedging problem under incomplete information. A new approach to solving this problem is proposed. The paper provides a solution when the underly…
New method generates diverse EHR data types while maintaining privacy.
Algorithm improves online canonical correlation analysis.