In this paper, we propose a new fast and robust recursive algorithm for near-separable nonnegative matrix factorization, a particular nonnegative blind source separation problem. This algorithm, which we refer to as the successive nonnegative projection algorithm (SNPA), is closely related to the popular successive pro…
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.
169,181 papers · 148 categories
Trend · papers per month
48 results for “Successive Projection”
Unified framework for multi-view learning with orthogonal projections.
problem Learning individual orthogonal projections for multiple views.
method Successive approximations via eigenvectors, iterative Krylov subspace method.
result Consistently competitive and often better than existing methods.
Robust SPA improves NMF robustness to outliers.
problem Non-robustness to outliers in SPA.
method Integrates outlier robustness and data fitting into SPA.
result RSPA is robust to outliers and maintains low-noise robustness.
Paper improves SPA and its variants' robustness to noise.
problem Robustness of successive projection algorithm (SPA) and its variants to noise.
method Proved and improved error bounds for SPA and variants.
result Significantly improved error bounds for SPA and variants under specific conditions.
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 successive projection algorithm (SPA) has been known to work well for separable nonnegative matrix factorization (NMF) problems arising in applications, such as topic extraction from documents and endmember detection in hyperspectral images. One of the reasons is in that the algorithm is robust to noise. Gillis and…
Modelo de maturidade em gerenciamento de riscos em projetos (Project Risk Management Model Maturity)q-fin.RM
The document proposes a model to measure project risk management maturity.
problem The rapid change in the global environment makes risk management crucial for project success.
method Develops a maturity model to assess organizations' risk management capabilities.
result Measures the effectiveness of organizations in managing project risks.
The Prescriptive Canvas improves business outcomes by directly prescribing actions based on predictions.
problem Sub-optimal performance in business projects due to a two-step approach of prediction and decision-making.
method The Prescriptive Canvas methodology for framing and communicating actions directly based on predictions.
result Improves framing and communication across stakeholders for successful business impact.
A modified SPA preconditioner enhances noise robustness in separable NMFs.
problem Noisy separable NMFs are challenging to solve efficiently.
method Proposes a modified SPA preconditioner to enhance noise robustness.
result The modified SPA preconditioner improves noise robustness without significantly increasing computational cost.
Pricing American Call Options by the Black-Scholes Equation with a Nonlinear Volatility Functionq-fin.CP
The paper extends Black-Scholes for American call options with variable volatility.
problem Pricing American call options with a nonlinear volatility function.
method Numerical method based on transformation of free boundary problem into Gamma variational inequality.
result Effective numerical scheme for pricing American call options with variable volatility.
Using results of Gathmann, we prove the following theorem: If a smooth projective variety X has generically semisimple (p,p)-quantum cohomology, then the same is true for the blow-up of X at any number of points. This a successful test for a modified version of Dubrovin's conjecture from the ICM 1998.
Research identifies risks in selecting project managers for civil engineering projects.
problem Lack of awareness of project manager selection criteria and associated risks.
method Combined ANP-FMEA approach for risk analysis.
result ANP-FMEA model identifies more significant risks than traditional FMEA.
The study develops a supervised and unsupervised WTA model for sparse binary projections.
problem Sparse binary projections in high-dimensional spaces.
method Supervised and unsupervised WTA models with efficient algorithms.
result Significantly improved results in similarity search tasks.
New method speeds up training of large kernel models.
problem Scaling kernel machines to large datasets and model sizes.
method Delayed projections in Preconditioned Stochastic Gradient Descent (PSGD).
result Significant training speed up over existing methods.
Develops a novel projectional method for inverse problems.
problem Addressing the incorporation of learned and non-learned priors in inverse problems.
method A novel projectional approach that incorporates these priors while ensuring data consistency.
result The PM can be implemented via Plug-and-Play priors and end-to-end training.
rpForests uses random projections to speed up kNN search.
problem Efficient kNN search in high-dimensional data.
method Random projection forests aggregating results from multiple random projection trees.
result rpForests achieves fast decay in missing rate and kNN distance discrepancy.
Proposes RNSE for clustering with adaptive similarity matrix learning.
problem Sub-optimal results due to mismatch between stages in Spectral Clustering.
method End-to-end single-stage learning with adaptive similarity matrix and non-negative constraints.
result Superior clustering performance on synthetic and real-world datasets.
New neural network approach for projection-free optimization.
problem Feasibility constraints in optimization problems.
method Designing projection-free convex optimization algorithms as Frank-Wolfe Networks.
result LSTM-learned optimizers outperform hand-designed and unconstrained optimizers.
Paper proposes SNAP algorithm for finding approximate SOSPs efficiently.
problem Finding approximate second-order stationary points of non-convex problems with linear constraints.
method SNAP algorithm uses strict complementarity condition and negative curvature projections.
result SNAP and SNAP achieve polynomial per-iteration complexity and global sublinear rate for finding SOSPs.
A new NMF variant tackles underdetermined problems with sparse and separable assumptions.
problem Underdetermined blind source separation, especially multispectral image unmixing.
method Sparse Separable Nonnegative Matrix Factorization (SSNMF) combining separability and sparsity assumptions. Algorithm based on SNPA and sparse nonnegative least squares.
result In noiseless settings, the algorithm recovers true underlying sources.
Paper proposes a new method for sentence embeddings using weighted word vectors.
problem Improving sentence embeddings for natural language processing tasks.
method A simple sentence embedding method using weighted average of word vectors followed by soft projection.
result Demonstrates effectiveness on clinical semantic textual similarity task.
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…
Estimating Early Fundraising Performance of Innovations via Graph-based Market Environment Modelcs.LG
Paper proposes a model to estimate early crowdfunding success.
problem Challenges in estimating early fundraising performance of innovations.
method Graph-based Market Environment model (GME) with graph neural networks.
result Effective model for estimating early fundraising performance.
This paper tackles unpaired data in multi-view learning, proposing a new framework and models.
problem Handling unpaired data in multi-view learning, which is more common than paired data.
method Generalized uncorrelated multi-view subspace learning framework with successive alternating approximation (SAA) method.
result Proposed models perform competitively or better than baselines in multi-view feature extraction and multi-modality classification.
With increasing concerns about security, the need for highly secure physical biometrics-based authentication systems utilizing \emph{cancelable biometric} technologies is on the rise. Because the problem of cancelable template generation deals with the trade-off between template security and matching performance, many …
The study of projective varieties with nef anticanonical divisors and log terminal singularities.
problem Understanding the structure and properties of projective varieties with specific divisor conditions.
method Analyzing the Albanese map and MRC fibration for klt projective varieties, showing locally constant fibrations and product decompositions.
result Generalization of results for smooth projective varieties to the klt case, including decomposition into rationally connected and projective varieties with trivial canonical divisor.
SCN learns and compensates for data bias in citizen science projects.
problem Data bias in citizen science datasets.
method End-to-end learning scheme that learns and compensates for data shift.
result SCN outperforms models that ignore data bias and handles massive high-dimensional data.
Principal Component Analysis (PCA) is a very successful dimensionality reduction technique, widely used in predictive modeling. A key factor in its widespread use in this domain is the fact that the projection of a dataset onto its first principal components minimizes the sum of squared errors between the original …
TROLL improves RL for LLMs by replacing clipping with a trust region projection.
problem Clipping in RL for LLMs causes instability and suboptimal performance.
method TROLL uses a discrete differentiable trust region projection to replace clipping, balancing computational cost and effectiveness.
result TROLL consistently outperforms PPO-like clipping in training speed, stability, and final success rates.
New algorithms improve blind source separation for linear-quadratic mixtures.
problem Blind source separation of linear-quadratic mixtures under separability assumptions.
method Proposed two algorithms: SNPALQ and BF. SNPALQ generalizes SNPA for LQ model, BF post-processes SNPALQ.
result Proven robustness and computational tractability of SNPALQ in separating sources even with 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.
Interactive tool for better understanding t-SNE projections.
problem Interpreting t-SNE projections can be challenging and misleading.
method Interactive visualization tool with different views.
result Improves understanding of t-SNE and its results.
Proposes rpf-kernel for clustering via random projection forests.
problem Clustering similar data points while distinguishing them from dissimilar ones.
method Random projection forests to learn a similarity kernel.
result rpf-kernel effectively clusters data with competitive performance.
Study exotic knottings of surfaces in 4-manifolds via symmetries.
problem Understanding knotted surfaces in 4-manifolds and their symmetries.
method Developed a recipe for projectively rigid surfaces and used techniques from convex geometry and hyperbolic geometry.
result Found finer knottedness phenomena through successive knotting, revealing more complex symmetries.
Study finds all helical surfaces with a constant ratio of principal curvatures.
problem Identifying helical surfaces with a constant ratio of principal curvatures.
method Employing the contours for parallel projection orthogonal to the helical axis, and solving an ordinary differential equation.
result Explicit CRPC surfaces beyond rotational ones are determined.
Deep 3D models are vulnerable to isometry transformations under adversarial attacks.
problem Vulnerability of deep 3D models to isometry transformations under adversarial attacks.
method Developed a black-box attack with success rate over 95% and a novel white-box attack framework.
result Deep 3D models are extremely vulnerable to isometry transformations under adversarial attacks.
The paper studies deformation spaces of Coxeter truncation polytopes.
problem Understanding the geometric properties and deformations of Coxeter truncation polytopes.
method Analyzing Coxeter truncation polytopes and their deformation spaces.
result Description of deformation spaces for Coxeter truncation polytopes of dimension .
PGD-trained models have a preferential direction in their gradients, which improves robustness.
problem Mathematical lack of clarity in the direction of preferential gradient alignment after adversarial training.
method Proposed a novel definition of preferential direction and evaluated it using a metric based on GANs.
result PGD-trained models have higher alignment with the proposed preferential direction than baseline models.
Random Projections and Natural Sparsity in Time-Series Classification: A Theoretical Analysisstat.ML
Rocket algorithm classifies time-series data efficiently using random projections and natural sparsity.
problem Time-series classification challenges in diverse fields.
method Random convolutional kernels, non-linear transformation, compressed sensing framework.
result Rocket algorithm preserves discriminative patterns in time-series data and expresses inherent sparsity.
New method trains neural nets without loss functions.
problem Training neural networks efficiently and without loss functions.
method Optimizer RRR derives steps from projections to local constraints, not gradients.
result Success in phase retrieval and neural networks, with novel partitioning of projections.
Light-based attacks can misclassify images without altering physical objects.
problem Physical attacks on deep learning classifiers are limited by the ability to modify inputs directly.
method Constructs an experimental setup with a light projection source, object, and camera. Uses differential evolution to select light patterns.
result Projected light can degrade classification accuracy from 98% to 22% for 2D objects and from 89% to 43% for 3D objects.
SPGD improves adversarial training efficiency and accuracy.
problem Improving adversarial training efficiency and accuracy with fewer steps.
method Adversarial-sample generation from a frequency domain perspective, extending PGD to the frequency domain.
result SPGD achieves greater adversarial accuracy compared to PGD with fewer attack steps.
New algorithms SVCA and SSPA improve robustness to noise in nonnegative matrix factorization.
problem Estimating vertices from noisy data points in convex hull.
method Smoothed VCA (SVCA) and Smoothed SPA (SSPA) algorithms.
result Improved robustness to noise compared to existing methods.
Pruning of redundant or irrelevant instances of data is a key to every successful solution for pattern recognition. In this paper, we present a novel ranking-selection framework for low-length but highly correlated instances. Instead of working in the low-dimensional instance space, we learn a supervised projection to …
DLOPT simplifies deep learning hyper-parameter optimization.
problem Finding optimal network configurations in deep learning.
method Introduces a novel library for hyper-parameter optimization.
result Demonstrates effectiveness through use examples.
Deep learning faces challenges in real-world tasks.
problem Challenges in applying deep learning to novel tasks without existing baselines.
method Case studies from research & development in conjunction with industry.
result Best practices for deep learning in practice.
This paper tackles high-dimensional Bayesian optimization by projecting a manifold into a lower space.
problem High-dimensional optimization of expensive functions with limited labeled data.
method Random linear projection of a manifold embedded in high-dimensional space, combined with semi-supervised learning of the manifold's geometry.
result Our approach outperforms existing high-dimensional BO methods in various synthetic and real-world applications.
Fewer degrees of freedom can train deep networks, showing a sharp phase transition.
problem Training deep networks with fewer degrees of freedom than parameters.
method Examined success probability of hitting training loss sub-level sets within random subspaces.
result Threshold training dimension increases as desired final loss decreases.