This paper presents a new ensemble learning method for classification problems called projection pursuit random forest (PPF). PPF uses the PPtree algorithm introduced in Lee et al. (2013). In PPF, trees are constructed by splitting on linear combinations of randomly chosen variables. Projection pursuit is used to choos…
On-device research index
arXiv research
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.
168,657 papers · 148 categories
Trend · papers per month
48 results for “variable projection”
Variable projection solves structured optimization problems by completely minimizing over a subset of the variables while iterating over the remaining variables. Over the last 30 years, the technique has been widely used, with empirical and theoretical results demonstrating both greater efficacy and greater stability c…
Sharp-SSL: Selective high-dimensional axis-aligned random projections for semi-supervised learningstat.ME
Sharp-SSL uses random projections to identify important variables for semi-supervised learning.
problem High-dimensional semi-supervised learning problems.
method Careful aggregation of low-dimensional results from many axis-aligned random projections.
result Sharp-SSL algorithm can recover signal coordinates with high probability.
New method selects variables for GP regression using sparse projection.
problem Identifying environmental factors affecting metal corrosion.
method Sparse projection of input variables, gradient descent optimization, non-convex marginal likelihood.
result Proposed method outperforms benchmarks in variable selection accuracy.
Future projection of climate is typically obtained by combining outputs from multiple Earth System Models (ESMs) for several climate variables such as temperature and precipitation. While IPCC has traditionally used a simple model output average, recent work has illustrated potential advantages of using a multitask lea…
VPNet uses variable projection for efficient neural network training.
problem Efficient and interpretable neural network training for signal processing.
method Variable projection (VP) applied to neural networks.
result VPNet achieves fast learning and good accuracy with low computational cost.
Field canals improvement projects (FCIPs) are one of the ambitious projects constructed to save fresh water. To finance this project, Conceptual cost models are important to accurately predict preliminary costs at the early stages of the project. The first step is to develop a conceptual cost model to identify key cost…
Approximate inference via information projection has been recently introduced as a general-purpose approach for efficient probabilistic inference given sparse variables. This manuscript goes beyond classical sparsity by proposing efficient algorithms for approximate inference via information projection that are applica…
Geodesic flows on Kähler manifolds are quantum integrable when metrics are c-projectively equivalent.
problem Quantum integrability of geodesic flows on Kähler manifolds under c-projective equivalence.
method Construction of Poisson-commuting integrals of motion and their quantum counterparts.
result The geodesic flow's integrals of motion commute as quantum operators, leading to separation of variables in Schrödinger's equation.
CE improves climate uncertainty quantification using GCM ensembles and observational data.
problem Uncertainty in climate projections due to model inadequacies and variability.
method Conformal ensembles integrating GCM ensembles and observational data.
result CE generates statistically rigorous, easy-to-interpret uncertainty estimates.
Stochastic Earned Value Analysis using Monte Carlo Simulation and Statistical Learning Techniquesq-fin.RM
Paper introduces a new project control method using Monte Carlo and statistical learning.
problem Project control under uncertainty.
method Integrates Earned Value Methodology with Monte Carlo simulation and statistical learning.
result Estimates probabilities of project success and duration.
The paper studies how norms of random vectors are preserved by random projections.
problem Understanding how random matrix affects norms of random vectors.
method Proved the distribution of the norm of random vector is preserved by random projection.
result Random matrix preserves the distribution of the norm of random vectors with i.i.d. entries.
We consider an important class of signal processing problems where the signal of interest is known to be sparse, and can be recovered from data given auxiliary information about how the data was generated. For example, a sparse Green's function may be recovered from seismic experimental data using sparsity optimization…
This paper examines three independent explanatory variables and their relation with cost overrun in order to decide whether this is different for Dutch infrastructure projects compared to worldwide findings. The three independent variables are project type (road, rail, and fixed link projects), project size (measured i…
Efficiently solves heterogeneous QPs by reducing variables using instance-specific projections.
problem Solving high-dimensional quadratic programming problems efficiently.
method Data-driven framework with a graph neural network generating projections tailored to each QP instance.
result Produces high-quality solutions with reduced computation time, outperforming existing methods.
In this work, we consider an extension of graphical models to random graphs, trees, and other objects. To do this, many fundamental concepts for multivariate random variables (e.g., marginal variables, Gibbs distribution, Markov properties) must be extended to other mathematical objects; it turns out that this extensio…
We extend the mixtures of Gaussians (MOG) model to the projected mixture of Gaussians (PMOG) model. In the PMOG model, we assume that q dimensional input data points z_i are projected by a q dimensional vector w into 1-D variables u_i. The projected variables u_i are assumed to follow a 1-D MOG model. In the PMOG model…
In this paper, we present a new explainability formalism designed to shed light on how each input variable of a test set impacts the predictions of machine learning models. Hence, we propose a group explainability formalism for trained machine learning decision rules, based on their response to the variability of the i…
A novel method reduces dimensionality for filtering SRNs with observed variables.
problem Challenges in estimating hidden state variables in SRNs with limited observations.
method Filtered Markovian Projection (Filtered MP) for dimensionality reduction in filtering.
result Filtered MP guarantees consistency and superior computational efficiency in high dimensions.
Proposes PredVAR model for reduced-dimensional dynamics from noisy data.
problem Extracting low-dimensional dynamics from high-dimensional noisy data.
method Probabilistic reduced-dimensional vector autoregressive model with oblique projection.
result Iterative algorithm yields dynamic latent variables with rank-ordered predictability.
New method converts LVAs into linear projections for better understanding of complex models.
problem Limited interpretability of nonlinear machine learning models.
method Animated linear projections and radial tours.
result Improved understanding of variable importance in complex models.
This paper characterizes projective models in statistical relational learning.
problem Projectivity in statistical relational models is beneficial for inference and learning.
method Representation theorems for infinite exchangeable arrays to characterize projective models.
result A class of directed graphical latent variable models correspond to projective relational models.
Multi-label classification has attracted an increasing amount of attention in recent years. To this end, many algorithms have been developed to classify multi-label data in an effective manner. However, they usually do not consider the pairwise relations indicated by sample labels, which actually play important roles i…
Study characterizes spike deconvolution basin for noisy data.
problem Recover spike locations from noisy convolution with PSF across multiple snapshots.
method Variable-projection formulation, explicit basin of convexity characterization, local convergence guarantees.
result Consistent estimator within basin of convexity under stochastic noise, complementary error bound under adversarial noise.
DiffSlack learns neural networks with nonlinear constraints via learnable slack variables.
problem Enforcing nonlinear inequality constraints in neural networks.
method DiffSlack reformulates inequalities as equalities with learnable slack variables, predicting them as part of the network output.
result DiffSlack achieves higher planning success rates and stronger geometric constraint satisfaction compared to existing methods.
Study evaluates risk in options using volatility surface projections.
problem Risk assessment of options due to their non-linear price behavior and volatility fluctuations.
method Parametric surface projection method for implied volatility.
result Enhanced risk evaluation through dynamic volatility surface analysis.
The paper develops a method for optimal projection selection in high-dimensional classification.
problem High-dimensional classification with latent variable structure.
method Formulates a latent-variable model and proposes a computationally efficient classifier.
result Explicit rates of convergence for excess risk of the proposed classifier are derived and shown to be optimal.
The paper tackles model collapse in GPLVMs by improving kernel flexibility and projection variance.
problem Model collapse in GPLVMs leading to vague latent representations.
method Theoretical analysis of projection variance, integration of SM and RFF kernels, and variational inference.
result The advisedRFLVM outperforms competing models in informative latent representations and missing data imputation.
We show that on any compact Riemann surface with variable negative curvature there exists a measure which is invariant and ergodic under the geodesic flow and whose projection to the base manifold is 2-dimensional and singular with respect to the 2-dimensional Lebesgue measure.
Improved semialgebraic choices with linear complexity.
problem Finding semialgebraic choices in projections with exponential complexity.
method Allowing approximate selections in Hausdorff sense.
result Constructed an approximate selection with linear degree in complexity.
Study of filtering and smoothing in submanifolds of Euclidean space.
problem Filtering and smoothing in continuous-discrete time on submanifolds.
method Formal expressions and projection approach for prediction and smoothing.
result Agreement with classical results for prediction, differences for smoothing.
A new algorithm speeds up EEG source localization using regularization.
problem Challenging inverse problem in mapping EEG readings to brain activity.
method Formulated as a graphical generalized elastic net inverse problem, solved with a variable projected algorithm (VPAL).
result VPAL provides faster and more accurate EEG source localization compared to existing methods.
Adapts stereographic projection for ellipsoid and elliptic paraboloid.
problem Projecting quadric surfaces using stereographic method.
method Adapted stereographic projection for ellipsoid and elliptic paraboloid, analyzing geometric properties and challenges.
result Established results on eccentricities, curvatures, arc length, and areas of intersections and projections.
Research funding agencies routinely use a proportion of their total revenues to support internal administration and marketing costs. The ratio of administration to total costs, referred to as the administration ratio, is highly variable and within any single fund depends on many factors including the number and average…
In [Alekseevsky, Gutt, Manno, Moreno: "A general method to construct invariant PDEs on homogeneous manifolds", Communications in Contemporary Mathematics (2021)] the authors have developed a method for constructing -invariant PDEs imposed on hypersurfaces of an -dimensional homogeneous space , under mild…
Variable selection is a challenging issue in statistical applications when the number of predictors far exceeds the number of observations . In this ultra-high dimensional setting, the sure independence screening (SIS) procedure was introduced to significantly reduce the dimensionality by preserving the true mod…
It is now known that an extended Gaussian process model equipped with rescaling can adapt to different smoothness levels of a function valued parameter in many nonparametric Bayesian analyses, offering a posterior convergence rate that is optimal (up to logarithmic factors) for the smoothness class the true function be…
The Straight-Through (ST) estimator is a widely used technique for back-propagating gradients through discrete random variables. However, this effective method lacks theoretical justification. In this paper, we show that ST can be interpreted as the simulation of the projected Wasserstein gradient flow (pWGF). Based on…
We introduce a method, KL-LIME, for explaining predictions of Bayesian predictive models by projecting the information in the predictive distribution locally to a simpler, interpretable explanation model. The proposed approach combines the recent Local Interpretable Model-agnostic Explanations (LIME) method with ideas …
A new method tests variable significance without assuming model correctness.
problem Testing variable significance in the presence of complex interactions.
method Flexible nonparametric or machine learning methods to estimate conditional mean independence.
result Achieves minimax optimal rate in nonparametric testing problem.
GNvPro efficiently trains neural networks with variable projection, improving accuracy and generalization.
problem Optimizing weights of neural networks for accurate approximation of input-target data.
method Variable projection (VarPro) extended to non-quadratic objectives, using Gauss-Newton method (GNvPro).
result GNvPro solves optimization problems more efficiently and finds better generalizing solutions.
Generative Adversarial networks (GANs) have obtained remarkable success in many unsupervised learning tasks and unarguably, clustering is an important unsupervised learning problem. While one can potentially exploit the latent-space back-projection in GANs to cluster, we demonstrate that the cluster structure is not re…
Study on volumes of random inscribed polytopes in projective geometries.
problem Estimating volumes of random inscribed polytopes in projective geometries.
method Central limit theorems and normal approximation for volumes and dual volumes of random inscribed polytopes.
result Established central limit theorems and normal approximation for volumes and dual volumes of random inscribed polytopes.
Materials design can be cast as an optimization problem with the goal of achieving desired properties, by varying material composition, microstructure morphology, and processing conditions. Existence of both qualitative and quantitative material design variables leads to disjointed regions in property space, making the…
On the generalization ability of coarse-grained molecular dynamics models for non-equilibrium processesphysics.comp-ph
New CGMD model predicts non-equilibrium processes better than existing methods.
problem Inconsistency in conditional distribution of unresolved variables.
method Time-lagged independent component analysis to minimize entropy contribution of unresolved variables.
result The model's generalization ability for non-equilibrium processes is significantly improved.
We introduce a general setting for multidimensional dispersionless integrable hierarchy in terms of differential -form with the coefficients satisfying the Plücker relations, which is gauge-invariantly closed and its gauge-invariant coordinates (ratios of coefficients) are (locally) holomorphic with respect to…
We use contact geometry to describe the monoid of projectively equivariant meromorphic differential operators on a complex curve, quantization of which generalizes known constructions of classical equivariants to non-commutative function algebras in several variables.
A dissertation on scalable projection-free optimization methods.
problem Efficient optimization algorithms for large-scale machine learning problems.
method Study of Frank-Wolfe variants and their extensions to distributed and derivative-free settings.
result Development of 1-SFW and QFW, achieving state-of-the-art complexity and efficiency.