PRISM-VQ combines financial priors with vector quantization for better stock prediction.
problem Predicting cross-sectional stock returns is hard due to low signal-to-noise ratios and changing market conditions.
method Integrates expert priors, vector-quantized latent factors, and dynamic factor loadings.
result Consistent improvements in cross-sectional return prediction and portfolio performance.
Method separates data into class and style factors using semi-supervised learning.
problem Separating generative factors of data into class and style vectors.
method Independent Vector Variational Autoencoders with semi-supervised learning and independence term.
result Improves classification performance and generation controllability.
Resonator Networks solve high-dimensional vector factorization better than optimization methods.
problem High-dimensional vector factorization problem in Vector Symbolic Architectures.
method Recurrent neural network (Resonator Networks) that combines nonlinear dynamics and superposition search.
result Resonator Networks outperform optimization methods in solving high-dimensional vector factorization.
The position of the EWS (economy-wide substitution)-ratio vector determines the Rybczynski sign pattern, which expresses the factor endowment--commodity output relationships, and the Stolper-Samuelson sign pattern, which expresses the commodity price--factor price relationships in a three-factor two-good general equili…
Explains historical connections between vector bundle splitting and Riemann-Hilbert problems.
problem Vector bundle splitting over the Riemann sphere.
method Historical overview and connections to other mathematical problems.
result Explains the Riemann-Hilbert-Birkhoff problems and their relation to vector bundle splitting.
In this document we are going to derive the equations needed to implement a Variational Bayes i-vector extractor. This can be used to extract longer i-vectors reducing the risk of overfittig or to adapt an i-vector extractor from a database to another with scarce development data. This work is based on Patrick Kenny's …
In a very high-dimensional vector space, two randomly-chosen vectors are almost orthogonal with high probability. Starting from this observation, we develop a statistical factor model, the random factor model, in which factors are chosen at random based on the random projection method. Randomness of factors has the con…
Polytopic Matrix Factorization models data as latent vectors from a polytope, maximizing determinant for identifiability.
problem Data decomposition with semi-structured latent vectors and polytope constraints.
method Model input data as latent vectors from a polytope, using determinant maximization for identifiability.
result Identifiability condition for polytopes with specific symmetry restrictions.
This paper presents a novel approach to speaker subspace modelling based on Gaussian-Binary Restricted Boltzmann Machines (GRBM). The proposed model is based on the idea of shared factors as in the Probabilistic Linear Discriminant Analysis (PLDA). GRBM hidden layer is divided into speaker and channel factors, herein t…
CP-factorization for high-dimensional tensor time series and double projection iterations
problem Identifying and estimating factor loadings in CP decomposition for high-dimensional tensor time series
method One-pass estimation procedure using standard eigen-analysis for matrix constructed based on serial dependence
result Asymptotic properties established under general settings, adapt to sparsity, accommodates weak factors
The paper classifies and constructs differential symmetry breaking operators from a line bundle to a vector bundle over real projective spaces.
problem Classifying and constructing differential symmetry breaking operators.
method Utilizing factorization identities and branching laws of generalized Verma modules.
result Differential symmetry breaking operators from a line bundle to a vector bundle over real projective spaces are classified and constructed.
The study extends Hano's theorem to semi-Riemannian product manifolds with specific conditions.
problem Extending Hano's theorem to manifolds with indefinite metrics.
method Generalization of Hano's theorem to semi-Riemannian product manifolds with specific conditions.
result The assumption on the factors is necessary for the generalization.
In this note, we derive concentration inequalities for random vectors with subGaussian norm (a generalization of both subGaussian random vectors and norm bounded random vectors), which are tight up to logarithmic factors.
Paper uses non-linear dimension reduction for better economic forecasting.
problem Analyzing economic effects of shocks in large datasets.
method Non-linear dimension reduction in factor-augmented vector autoregressions.
result Non-linear dimension reduction techniques improve forecasting, especially in volatile data.
With the widespread engineering applications ranging from artificial intelligence and big data decision-making, originally a lot of tedious financial data processing, processing and analysis have become more and more convenient and effective. This paper aims to improve the accuracy of stock price forecasting. It improv…
Constructs a representation of the string 2-group on a von Neumann algebra.
problem Establishing a categorified spinor representation of the string 2-group.
method Using the Morita bicategory of von Neumann algebras, specifically the hyperfinite type III_1 factor.
result Demonstrates a categorification of the spinor representation.
Study shows how Poisson brackets factor on infinite dimensional manifolds.
problem Understanding Poisson brackets on infinite dimensional manifolds.
method Analyzes Poisson brackets on smoothly paracompact manifolds with specific properties.
result Dual map of a Poisson bracket factors as a smooth section of a vector bundle.
Model predicts EU carbon prices using market and political factors.
problem Predict future carbon prices for EU market management.
method Support vector regression with grid search and cross validation.
result Model predicts carbon prices accurately for 2030.
This short report establishes some basic properties of smooth vector fields on product manifolds. The main results are: (i) On a product manifold there always exists a direct sum decomposition into horizontal and vertical vector fields. (ii) Horizontal and vertical vector fields are naturally isomorphic to smooth famil…
New method for high-dimensional manifold-based inference tackles latent responses.
problem Inference on latent right factor vectors in multi-task learning with large numbers of responses and features.
method SOFARI-R method with two variants: one for strongly orthogonal factors and another for weakly orthogonal factors.
result Bias-corrected estimators for latent right factor vectors with asymptotically normal distributions and justified asymptotic variance estimates.
Proposes a robust factor analysis for matrix data.
problem Robust factor analysis for matrix data with heavy-tailed or contaminated data.
method Bilinear factor analysis based on the matrix-variate t distribution. result Significantly higher breakdown point than traditional methods.
DSARF models complex spatio-temporal data with deep switching auto-regressive factors.
problem Forecasting complex spatio-temporal data with recurring patterns.
method Deep switching auto-regressive factorization (DSARF) with stochastic variational inference.
result DSARF outperforms state-of-the-art methods in long- and short-term prediction accuracy.
Topic-aware chatbot learns from NMF topic vectors.
problem Improving chatbot relevance based on user topics.
method Combines RNN with NMF for topic learning and attention.
result Chatbot provides more relevant answers based on topic.
Many modern tools in machine learning and signal processing, such as sparse dictionary learning, principal component analysis (PCA), non-negative matrix factorization (NMF), K-means clustering, etc., rely on the factorization of a matrix obtained by concatenating high-dimensional vectors from a training collection. W…
Neural network implementation of Brenier's polar factorization for vector fields.
problem Implementing Brenier's polar factorization theorem for vector fields using neural networks.
method Parameterizing the convex function u as an input convex neural network and estimating the measure-preserving map M. result Practical neural implementation of Brenier's polar factorization theorem.
This paper constructs and studies the long-term factorization of affine pricing kernels into discounting at the rate of return on the long bond and the martingale component that accomplishes the change of probability measure to the long forward measure. The principal eigenfunction of the affine pricing kernel germane t…
We prove that the foam and matrix factorization universal rational sl3 link homologies are naturally isomorphic as projective functors from the category of link and link cobordisms to the category of bigraded vector spaces.
Simplified KR polynomial for bipartite links reduces to tensor products of vector spaces.
problem Complexity reduction of Khovanov-Rozansky polynomial for bipartite links.
method Local reduction of matrix factorizations to planar cycles and simplification to vector spaces.
result KR polynomial for bipartite links simplifies to tensor products of vector spaces.
Novel proof technique for Gelfand-Fuks cohomology.
problem Comparing sheaf-like data over manifold Cartesian powers.
method Local-to-global analysis through generalized good covers and factorization algebras.
result Unified approach to Gelfand-Fuks cohomology.
Tackling pattern recognition problems in areas such as computer vision, bioinformatics, speech or text recognition is often done best by taking into account task-specific statistical relations between output variables. In structured prediction, this internal structure is used to predict multiple outputs simultaneously,…
New bound on Rademacher complexity for vector functions.
problem Bounding Rademacher complexity for vector-valued functions.
method Bounding Rademacher complexity by coordinate-wise complexity with a factor of sqrt(K).
result Rademacher complexity is bounded by the maximum coordinate-wise complexity times sqrt(K).
Study on InstaHide's security, linking to phase retrieval problem.
problem Security of InstaHide scheme for private dataset sharing.
method Design of a provable algorithm for private vector recovery.
result Private vectors can be recovered using synthetic vectors and public vectors.
Efficiently representing real world data in a succinct and parsimonious manner is of central importance in many fields. We present a generalized greedy pursuit framework, allowing us to efficiently solve structured matrix factorization problems, where the factors are allowed to be from arbitrary sets of structured vect…
Develops novel techniques for collaborative filtering and multi-label classification.
problem Information overload and categorization of data objects.
method Hierarchical bi-level maximum margin matrix factorization and piecewise-linear embedding method.
result Effective multi-label classification and collaborative filtering techniques developed.
Efficiently factorize tensors in streaming data with coreset selection.
problem Efficiently factorize tensors in streaming data.
method Online filtering and kernelization techniques to select a coreset of vectors.
result CP decomposition of coreset approximates full data tensor decomposition.
DaConA improves recommendation accuracy with auxiliary data by adapting to different data contexts.
problem Improving recommendation accuracy with auxiliary data considering different data contexts.
method Data context adaptation layer, latent interaction vector, latent independence vector, non-linear function.
result DaConA achieves state-of-the-art accuracy on real-world datasets.
New method estimates Gaussian vector functions more efficiently.
problem Estimating functions of Gaussian vectors with high dimensions.
method Combines randomized dimension reduction and PCA.
result Algorithm outperforms Monte Carlo method by a factor of d.
Introduces factor risk measures to assess risk relative to multiple factors.
problem Measuring risk relative to multiple factors.
method Introduces a double-argument mapping as a risk measure to assess risk relative to a vector of factors.
result Characterizes various types of factor risk measures including distortion, quantile, linear, and coherent measures.
New ONMF model minimizes KL divergence for better sparse data modeling.
problem Clustering and data modeling with sparse vectors.
method Developed KL-ONMF algorithm based on alternating optimization.
result KL-ONMF outperforms Frobenius-norm ONMF for document classification and hyperspectral image unmixing.
Paper proves min-vol NMF robust to noise under expanded condition.
problem Robustness of min-vol NMF to noise.
method Proved robustness under expanded sufficiently scattered condition.
result Proves min-vol NMF identifies groundtruth factors in noise.
In this work one shows that given a connected C∞-manifold M of dimension ≥2 and a finite subgroup $G\subset \Diff(M)$, there exists a complete vector field X on M such that its automorphism group equals G×R where the factor R comes from the flow of X.
New algorithms for SSMF with weaker identifiability conditions than SSC.
problem Identifying unique decompositions in simplex-structured matrix factorization.
method Extracting facets containing the largest number of points to ensure identifiability.
result Our algorithms recover unique decompositions under weaker conditions than SSC.
The Multiplicative Error Model (Engle (2002)) for nonnegative valued processes is specified as the product of a (conditionally autoregressive) scale factor and an innovation process with nonnegative support. A multivariate extension allows for the innovations to be contemporaneously correlated. We overcome the lack of …
Improves ROC/AUC for multi-class classification.
problem Lack of sensible plots, sensitivity to imbalanced data, inability to specify mis-classification cost, and lack of evaluation uncertainty quantification.
method Factorizes multi-class ROC into a one-dimensional vector representation for visualization and summary.
result Provides a binary AUC-equivalent summary and mis-classification weights specification.
Bayesian Temporal Factorization predicts multidimensional time series with missing data.
problem Predicting large-scale, multidimensional spatiotemporal data with missing values.
method Integrates low-rank matrix/tensor factorization and VAR process into a probabilistic model.
result Superior performance on real-world spatiotemporal data sets compared to existing methods.
New vector fields integrate first-order ODEs.
problem Integrating first-order ODEs.
method Relation between Riemannian manifolds and ODEs integration.
result Integration procedure for first-order ODEs.
Test-asset construction affects factor model performance.
problem How test assets are constructed impacts factor model performance.
method Forming characteristic-unsorted random portfolios and varying stock selection, initial weighting, holding, and rebalancing.
result Test-asset construction shifts factor model rankings materially.
Introduces nondecreasing rank for matrices and tensors, developing methods and applications.
problem Finding low-rank approximations for matrices and tensors with monotonic constraints.
method Developed a variant of hierarchical alternating least squares algorithm for finding low ND rank approximations.
result Low ND rank factorizations can be found and interpreted for real-world datasets.