RaFM improves FM performance with variable-rank embeddings.
problem Learning pairwise interactions with varying feature frequencies.
method Introduces RaFM with variable-rank embeddings for better performance.
result RaFM achieves better performance on real-world datasets.
Latent factor models for Recommender Systems with implicit feedback typically treat unobserved user-item interactions (i.e. missing information) as negative feedback. This is frequently done either through negative sampling (point--wise loss) or with a ranking loss function (pair-- or list--wise estimation). Since a ze…
Machine learning factors outperform traditional portfolio optimization methods.
problem Comparing machine learning and traditional portfolio optimization methods.
method Examined machine learning and factor-based portfolio optimization using autoencoder neural networks and dimensionality reduction techniques.
result Minimum-variance portfolios using latent factors derived from autoencoders and sparse methods outperform simpler benchmarks in risk minimization.
A new KD model for collaborative filtering improves top-N recommendation performance.
problem Challenges in applying KD to recommender models due to feedback sparsity and ambiguity.
method Proposes a new KD model (CD) for collaborative filtering, reformulating a loss function, using probabilistic rank-aware sampling, and developing training strategies.
result Outperforms state-of-the-art methods by 2.7-33.2% in hit rate (HR) and 2.7-29.1% in NDCG.
Random forest identifies key features for diagnosing machine faults.
problem Identifying specific factors causing machine faults.
method Gaussian mixture model clustering, spectrum analysis, random forest classification.
result Identified significant features for different machine states.
Extracts factors from Treasury yields using ML techniques.
problem Understanding factors underlying Treasury yields.
method Nonnegative Matrix Factorization (NMF) and clustering.
result Factors identified through NMF and clustering.
DS-FACTO optimizes factorization machines for large-scale datasets.
problem High memory overheads of factorization machines on large datasets.
method Hybrid-parallel stochastic optimization algorithm DS-FACTO.
result DS-FACTO reduces memory requirements and scales to large datasets.
Paper uses machine learning to uncover nonlinear dynamics in CAT bond pricing.
problem Traditional linear models miss nonlinear relationships in CAT bond pricing.
method Advanced machine learning techniques applied to CAT bond transaction records.
result Machine learning enhances CAT bond pricing accuracy and reveals complex risk interactions.
Factor Engine simplifies financial factor computation and analysis in Python.
problem Efficient computation and analysis of financial factors.
method Modular, extensible Python library with decorators, integrates with data science ecosystem.
result Mispricing factors computed by Factor Engine and Stata implementation are highly similar.
Paper explores subdifferential chain rules for matrix factorization and related machine learning models.
problem Clarke subdifferential chain rules for matrix factorization and factorization machines.
method Analyzes conditions for subdifferential chain rules to hold, especially for overparameterized models.
result Subdifferential chain rules hold for matrix factorization and factorization machines under certain conditions.
Framework learns to separate predictive from nuisance factors for robust machine learning.
problem Supervised models associate irrelevant factors with prediction targets, hurting generalization.
method Information-theoretic formulation for discovering and separating predictive and nuisance factors.
result State-of-the-art performance achieved without requiring nuisance annotations.
Paper predicts international trade flows using machine learning and factorization models.
problem Predicting international bilateral trade flows with PTAs.
method Two-stage approach combining SHAP Explainer and Factorization Machine models.
result Enhanced predictive accuracy and deeper insights into trade dynamics.
Recently, Factorization Machines (FM) has become more and more popular for recommendation systems, due to its effectiveness in finding informative interactions between features. Usually, the weights for the interactions is learnt as a low rank weight matrix, which is formulated as an inner product of two low rank matri…
Machine learning creates non-factor covariance matrices for risk models.
problem Creating robust risk models for financial portfolios.
method Developed an explicit algorithm and source code for machine learning risk models.
result Machine learning models outperform traditional risk models in empirical backtests.
The preceding paper constructed tangle machines as diagrammatic models, and illustrated their utility with a number of examples. The information content of a tangle machine is contained in characteristic quantities associated to equivalence classes of tangle machines, which are called invariants. This paper constructs …
We propose the convex factorization machine (CFM), which is a convex variant of the widely used Factorization Machines (FMs). Specifically, we employ a linear+quadratic model and regularize the linear term with the ℓ2-regularizer and the quadratic term with the trace norm regularizer. Then, we formulate the CFM o…
NeuralFactors uses deep learning to improve factor analysis in equity modeling.
problem Enhancing classical factor models for better risk forecasting and portfolio construction.
method Introduces a novel machine-learning approach (NeuralFactors) that outputs factor exposures and returns, trained using variational autoencoders.
result NeuralFactors outperforms prior approaches in log-likelihood performance and computational efficiency.
Machine learning helps estimate risk premiums of stocks without knowing their factors.
problem Estimate risk premiums of stocks without knowing their underlying factors.
method Used elastic-net machine learning to project stock returns onto peers and construct replicate portfolios.
result Unique stocks have higher SARP and excess returns than ubiquitous stocks.
Paper proposes C-STM for multimodal neuroimaging data classification.
problem Multimodal neuroimaging data fusion for better classification.
method Coupled Support Tensor Machine (C-STM) using latent factors from ACMTF.
result C-STM achieves better classification performance than single-mode classifiers.
Proposes FEFM and DeepFEFM for CTR prediction, outperforming state-of-the-art models.
problem Click-through rate prediction in online applications.
method Field-Embedded Factorization Machine (FEFM) and its deep counterpart DeepFEFM, combining feature embeddings and deep neural networks.
result FEFM and DeepFEFM outperform existing models in CTR prediction tasks.
Proposes a new machine learning-based method for conjoint analysis.
problem Testing the importance of factors in conjoint analysis with interactions.
method Conditional randomization test based on machine learning algorithms.
result Validates the importance of factors in conjoint analysis without model specification.
Enhanced AI analysis predicts S&P 500 stock dynamics using various financial metrics.
problem Predicting S&P 500 stock performance with complex interplay of factors.
method Advanced financial metrics, machine learning, and integration of traditional and modern analytics.
result Enhanced predictive accuracy in market behavior and investment strategies.
Framework identifies causal factors of climate change using correlations and machine learning.
problem Understanding socioeconomic factors influencing carbon emissions and climate change.
method Three-step framework: correlation analysis, causal discovery, LLM interpretations.
result Adaptable solutions for data-driven policy-making and strategic decision-making.
Product Kanerva Machines dynamically combine smaller models for better memory organization.
problem Limited organization in the Kanerva Machine.
method Introducing Product Kanerva Machines that dynamically combine multiple smaller Kanerva Machines.
result Product Kanerva Machines can discover spatial tunings that approximately factorize simple images by object.
For a learning task, data can usually be collected from different sources or be represented from multiple views. For example, laboratory results from different medical examinations are available for disease diagnosis, and each of them can only reflect the health state of a person from a particular aspect/view. Therefor…
Knowledge tracing is a sequence prediction problem where the goal is to predict the outcomes of students over questions as they are interacting with a learning platform. By tracking the evolution of the knowledge of some student, one can optimize instruction. Existing methods are either based on temporal latent variabl…
FSGD uses latent factors to scale SGD for high-dimensional learning.
problem Scalable optimization in high-dimensional machine learning.
method Factor-Augmented SGD (FSGD) that operates on streaming data.
result Established theoretical framework for latent factor estimation error in SGD.
FactorGCL uses hypergraph learning to predict stock returns by mining hidden factors.
problem Mining effective factors in data-driven models is challenging due to low signal-to-noise ratio in market data.
method FactorGCL employs a hypergraph structure and temporal residual contrastive learning to extract hidden factors.
result FactorGCL outperforms existing methods and mines effective hidden factors for predicting stock returns.
Tensor variable elimination for plated factor graphs enables exact inference in models with repeated structure.
problem Efficient inference in models with repeated structure.
method Generalized variable elimination to tensor variable elimination on plated factor graphs.
result Tractable inference for a class of plated factor graphs.
Tensor-networks enhance probabilistic modeling in physics and machine learning.
problem Understanding the expressive power of different tensor-network factorizations.
method Rigorous analysis of various tensor-network factorizations of discrete multivariate probability distributions.
result There are unbounded separations between the resource requirements of some tensor-network factorizations.
Proposes MLDP for modeling multilinear data.
problem Handling data with interactions from multiple factors.
method Combines Dirichlet processes with multilinear factor analysis.
result Achieved state-of-the-art performance on real-world data.
Novel KAN-based autoencoder improves asset pricing models' accuracy and interpretability.
problem Improving asset pricing models' accuracy and interpretability.
method Kolmogorov-Arnold Networks (KANs) inspired autoencoder for latent factor exposures.
result Outperforms Multilayer Perceptrons in both accuracy and interpretability.
Method controls extrapolation in prediction profiles for statistical and machine learning models.
problem Avoiding invalid predictions due to extrapolation in prediction profiles.
method Genetic algorithm optimization over constrained factor regions.
result Optimal factor settings without constraint are often invalid and extrapolated.
Machine learning models predict depression risk based on various factors.
problem Identifying individuals at greatest risk for depression.
method Random Effects/Expectation Maximization (RE-EM) trees and Mixed Effects Random Forest (MERF) algorithms.
result Machine learning models accurately predict depression severity and identify key predictors.
FiBiNET combines feature importance and bilinear interactions for CTR prediction.
problem Improving click-through rate prediction in advertising and feed ranking systems.
method FiBiNET dynamically learns feature importance via SENET and bilinear feature interactions.
result FiBiNET outperforms shallow and deep models on real-world datasets.
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…
Hardware-accelerated RBM solves large combinatorial problems and integer factorization.
problem Solving large combinatorial optimization and integer factorization problems.
method Logically synthesized RBM architecture, hardware acceleration, and efficient training methods.
result Hardware-accelerated RBM factorizes 16-bit numbers with 10000x speed and 32x power improvements.
Study analyzes Disney stock market performance using machine learning.
problem Forecasting stock market performance of Disney.
method Exploratory data analysis, feature engineering, model selection (linear regression).
result Linear regression model performed best.
This paper introduces our solution to the 2018 Duolingo Shared Task on Second Language Acquisition Modeling (SLAM). We used deep factorization machines, a wide and deep learning model of pairwise relationships between users, items, skills, and other entities considered. Our solution (AUC 0.815) hopefully managed to bea…
Nonnegative Boltzmann machines (NNBMs) are recurrent probabilistic neural network models that can describe multi-modal nonnegative data. NNBMs form rectified Gaussian distributions that appear in biological neural network models, positive matrix factorization, nonnegative matrix factorization, and so on. In this paper,…
Proposes a deep latent factor model for better recommendation systems.
problem Improving collaborative filtering in recommendation systems.
method Introduces a deeper latent factor model using deep learning.
result Significantly outperforms state-of-the-art techniques in experiments.
Newsroom in online ecosystem is difficult to untangle. With prevalence of social media, interactions between journalists and individuals become visible, but lack of understanding to inner processing of information feedback loop in public sphere leave most journalists baffled. Can we provide an organized view to charact…
Study uses ML and causal analysis to predict student performance factors.
problem Understanding socio-academic and economic factors affecting student performance.
method Employed machine learning techniques and causal analysis on 1,050 student profiles.
result Ridge Regression achieved robust predictions with MAE of 0.12 and MSE of 0.024.
Optimizes FM model complexity for better feature interaction learning.
problem Improving the sampling complexity of generalized Factorization Machine models.
method Developed a tighter sampling complexity bound for generalized Factorization Machine models under specific distribution assumptions.
result Improved sampling complexity bound for generalized FM models, approaching optimal complexity.
In order to achieve state-of-the-art performance, modern machine learning techniques require careful data pre-processing and hyperparameter tuning. Moreover, given the ever increasing number of machine learning models being developed, model selection is becoming increasingly important. Automating the selection and tuni…
Factor models are a class of powerful statistical models that have been widely used to deal with dependent measurements that arise frequently from various applications from genomics and neuroscience to economics and finance. As data are collected at an ever-growing scale, statistical machine learning faces some new cha…
Smart app tracks relapse history and predicts relapse based on spatial-temporal factors.
problem Relapse prevention for alcohol and tobacco addiction users.
method Records user profiles, tracks relapse history, uses machine learning for prediction, and recommends activities.
result Predictive machine learning algorithms help in preventing relapse.
Study proposes a new method for deep portfolio optimization using residual factors.
problem Non-stationary financial market makes traditional machine learning methods ineffective.
method Predict distribution of residual factors using a novel neural network architecture with financial inductive biases.
result Demonstrated improved performance on U.S. and Japanese stock market data.