New algorithm reduces adaptive regret without projections.
problem Computational expense of projections in online convex optimization.
method Lazy gradient-based algorithm with set-membership computations.
result Near-optimal adaptive regret bounds for general convex functions.
TapNet uses neural networks with task-adaptive projection for improved few-shot learning.
problem Handling previously unseen tasks with limited training examples.
method Meta-learning strategy with episode-based training, task-adaptive projection.
result State-of-the-art classification accuracies on various few-shot learning datasets.
Paper presents a fast and adaptive filter for SI suppression in full-duplex transceivers.
problem Self-interference suppression in full-duplex transceivers with nonlinearity.
method Adaptive projected subgradient method (APSM) in a reproducing kernel Hilbert space (RKHS).
result The proposed method achieves favorable digital SIC performance compared to benchmarks.
MCAP clusters high-dimensional data via adaptive projections, handling large p efficiently.
problem Statistical and computational challenges in high-dimensional mixture models.
method Model-based Clustering via Adaptive Projections (MCAP) using linear projections.
result MCAP reliably detects covariance signals in very high-dimensional problems.
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.
Flora uses random projections to achieve high-rank updates with low memory usage.
problem Excessive memory usage in large neural networks during training.
method Flora approximates LoRA using random projections to enable high-rank updates with sublinear space complexity.
result Flora achieves high-rank updates with significantly reduced memory usage compared to LoRA.
CDSPP learns domain-specific projections for heterogeneous domain adaptation.
problem Heterogeneous domain adaptation problems where source and target domains have different modalities or feature dimensions.
method Cross-Domain Structure Preserving Projection (CDSPP) algorithm that learns domain-specific projections to map features into a common subspace.
result CDSPP achieves superior performance in both supervised and semi-supervised HDA compared to state-of-the-art methods.
LDAdam optimizes large models with low memory by adapting to lower-dimensional subspaces.
problem Training large models efficiently and accurately.
method Adaptive optimization in lower-dimensional subspaces with a new projection-aware update rule and error feedback mechanism.
result LDAdam achieves accurate and efficient training of language models.
We study curvature-adapted submanifolds of general symmetric spaces. We generalize Cartan's theorem for isoparametric hypersurfaces of spheres and Wang's classification of isoparametric Hopf hypersurfaces in complex projective spaces to any compact symmetric space. Our second objective is to investigate such hypersurfa…
Study projective and direct limits of Banach structures with connections to G-structures.
problem Understanding connections between Banach structures and G-structures. method Endow projective and direct limits with Fréchet or convenient structures and study connections.
result Illustrated examples demonstrate the study of projective and direct limits.
We propose a novel adaptive learning algorithm based on iterative orthogonal projections in the Cartesian product of multiple reproducing kernel Hilbert spaces (RKHSs). The task is estimating/tracking nonlinear functions which are supposed to contain multiple components such as (i) linear and nonlinear components, (ii)…
Adaptive framework improves nonparametric dimensionality reduction.
problem Optimal hyper-parameter tuning for nonparametric dimensionality reduction.
method Adaptive framework using intrinsic dimension estimator and optimal local neighbourhood sizes.
result Significant improvements in various learning tasks through better low-dimensional visualizations.
Random projections of labels enable feedforward training of deep neural networks without feedback.
problem Biological plausibility and low-cost adaptive smart sensors constrained by backpropagation.
method Fixed random projections of targets for feedforward training of hidden layers.
result DRTP algorithm provides a tradeoff between accuracy and computational cost suitable for edge computing.
Projected random forests improve circular data prediction with adaptive arc length and finite-sample coverage.
problem Regression with circular responses.
method Adapting linear-response models to circular data using projection and random forest out-of-bag mechanism.
result Projected random forest out-of-bag conformal prediction sets are more efficient and shorter than alternative methods.
MILDA uses unlabelled data to compute LDA projections.
problem Training LDA models with unlabelled data.
method Minimal prior information to compute LDA projection vector.
result MILDA closely matches supervised LDA performance and adapts to non-stationary data.
Adapts POD basis for parametric ROMs using pGP.
problem Updating POD basis for accurate system behavior over parameter space.
method Formulates problem as supervised statistical learning, uses pGP to learn mapping between parameter space and Grassmann manifold.
result Proposes pGP for optimal estimation of POD basis parameters and quantifies uncertainty.
A new method transfers parameters in ELM networks using projective model.
problem Parameter transfer in extreme learning machine networks.
method Projective model to bridge source and target model parameters, L2,1-norm penalty for joint feature selection and parameter transfer.
result Significantly outperforms non-transfer ELM networks and other methods.
A new method for Bayesian inference in high dimensions using projected Stein variational gradient descent.
problem Bayesian inference challenges in high-dimensional data.
method Adapting Stein variational gradient descent to exploit intrinsic low dimensionality of data.
result pSVGD is more accurate and efficient than SVGD, especially in high-dimensional settings.
The paper defines projective structures for Lie bialgebras and Poisson-Lie groups.
problem Defining projective analogues of Lie bialgebras and Poisson-Lie groups.
method Introducing projective tensor products and adapting classical notions to these structures.
result Every quasi-triangular projective r-matrix gives rise to a projective Banach Lie bialgebra.
Gradient boosting adapted for multi-label and multi-output tasks.
problem Joint prediction of multiple classification or regression outputs.
method Gradient tree boosting with random output projections.
result Random projection improves adaptation to different output correlation patterns.
We develop in detail the theory of c-projective geometry, a natural analogue of projective differential geometry adapted to complex manifolds. We realise it as a type of parabolic geometry and describe the associated Cartan or tractor connection. A Kaehler manifold gives rise to a c-projective structure and this is one…
The paper studies how points and lines can move while preserving incidences.
problem Understanding how point-line configurations can move while maintaining their geometric relationships.
method Developed a projective rigidity matrix to analyze the infinitesimal motions and dependencies of point-line configurations.
result The symmetry-adapted projective rigidity matrix provides a more detailed analysis of symmetric configurations and their motions.
A new method routes EEG covariance matrices across domains using adaptive subspace selection.
problem Challenges in cross-domain EEG decoding due to distinct SPD manifold regions.
method Dynamic Stiefel routing with expert filters and cross-attention for adaptive subspace projection.
result Consistent gains across three datasets: balanced accuracy improves from 0.773 to 0.823, 0.757 to 0.809, and 0.801 to 0.839.
The paper studies projections of asset prices under equivalent martingale measures.
problem Understanding the impact of information on asset price bubbles and arbitrage opportunities.
method Analyzes optional projections of local martingales into a smaller filtration under equivalent martingale measures.
result Provides general results and specific examples like inverse Bessel process and stochastic volatility models.
The Random Projection Tree structures proposed in [Freund-Dasgupta STOC08] are space partitioning data structures that automatically adapt to various notions of intrinsic dimensionality of data. We prove new results for both the RPTreeMax and the RPTreeMean data structures. Our result for RPTreeMax gives a near-optimal…
Optimizes hard-to-optimize metrics using adaptive surrogates.
problem Training models with black-box and hard-to-optimize metrics.
method Expresses metric as a function of surrogates, solves optimization problem over relaxed surrogate space.
result Approach performs on par with known methods and adds value when metric form is unknown.
Proof confirms preservation of projective limits in synthetic differential geometry.
problem Prove preservation of projective limits in synthetic differential geometry.
method Detailed proof using synthetic differential geometry and Cahiers topos.
result Projective limits preserved in synthetic differential geometry.
New method uses fewer parameters to match state-of-the-art performance on multiple natural language tasks.
problem Efficiently adapting BERT for multiple tasks with fewer parameters.
method PALs (projected attention layers) for shared BERT model with task-specific parameters.
result Matches state-of-the-art performance on GLUE benchmark with 7 times fewer parameters.
We develop a projected Nesterov's proximal-gradient (PNPG) approach for sparse signal reconstruction that combines adaptive step size with Nesterov's momentum acceleration. The objective function that we wish to minimize is the sum of a convex differentiable data-fidelity (negative log-likelihood (NLL)) term and a conv…
Unified framework for distribution shift estimation, explanation, and improvement.
problem Estimating, explaining, and improving model performance on target domains with distribution shift.
method Entropic Projection Alignment (EPA) aligns source and target distributions by matching moments and minimizing KL divergence.
result EPA consistently outperforms state-of-the-art baselines while offering computational efficiency.
Free Random Projection enhances reinforcement learning by naturally incorporating hierarchical structure.
problem Improving reinforcement learning algorithms for better generalization and adaptability.
method Introduces Free Random Projection, a method that uses free probability theory to create random orthogonal matrices encoding hierarchical structure.
result Empirically shows consistent improvement in generalization over standard methods on multi-environment benchmarks.
We adapt the idea of random projections applied to the output space, so as to enhance tree-based ensemble methods in the context of multi-label classification. We show how learning time complexity can be reduced without affecting computational complexity and accuracy of predictions. We also show that random output spac…
Three new efficient algorithms project vectors onto weighted l1 ball.
problem Sparse system identification and feature selection.
method Projected gradient descent algorithms with linear or highly competitive quadratic worst case complexities.
result Efficient tools for machine learning methods like compress sensing and feature selection.
Physics-informed neural networks improve by measuring effective dimensionality of constraints.
problem Task interference in physics-informed neural networks due to shared parameter space.
method Introduce effective dimensionality (deff) as an operator invariant to quantify constraints. result Effective dimensionality measures unconstrained parameter directions, independent of network architecture.
The paper characterizes new invariant spinr spinors on projective spaces.
problem Characterizing new invariant spinr spinors on projective spaces. method Adapting spin representation via exterior forms to the generalised spinr context. result Complete description of the space of invariant spinr spinors for CPn, HPn, and OP2. 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…
Project aims to improve robot vision by adapting to new environments.
problem Robots struggle to recognize objects in new settings.
method Selected and evaluated state-of-the-art DA methods on various datasets.
result Training a good object classifier remains challenging.
Basis adaptation in Homogeneous Chaos spaces rely on a suitable rotation of the underlying Gaussian germ. Several rotations have been proposed in the literature resulting in adaptations with different convergence properties. In this paper we present a new adaptation mechanism that builds on compressive sensing algorith…
Method estimates M-matrices in graphical models with improved accuracy.
problem Estimating M-matrices as precision matrices in Gaussian graphical models.
method Adaptive multiple-stage estimation method solving weighted ℓ1-regularized problems.
result Method outperforms state-of-the-art methods in precision matrix estimation and graph edge identification.
Deployment of emerging technologies and rapid change in industries has created a lot of risk for initiating the new projects. Many techniques and suggestions have been introduced but still lack the gap from various prospective. This paper proposes a reliable project scheduling approach. The objectives of project schedu…
The paper extends Nambu-Poisson structures to infinite dimensions.
problem Extending Nambu-Poisson structures to infinite dimensional settings.
method Adapting finite dimensional Nambu-Poisson structures to a convenient manifold setting.
result Classical results in finite dimensions can be extended to infinite dimensions for partial Nambu structures.
Efficient methods reduce projections in non-stationary online learning.
problem Optimizing dynamic and adaptive regret in non-stationary online learning environments.
method Presented efficient methods reducing the number of projections per round from O(logT) to 1. result Reduced number of projections per round from O(logT) to 1 for optimizing dynamic and adaptive regret. We develop a probabilistic framework for sequential random projection.
problem Challenges of sequential decision-making under uncertainty.
method Novel construction of a stopped process and method of mixtures.
result Achieved a non-asymptotic probability bound for random projection.
Adaptive probabilistic PCA adapts complexity with varying subspaces.
problem Adaptive probabilistic PCA models varying complexity in data.
method Relaxed linear Gaussian model with discrete latent variables, Bayesian nonparametric approach.
result Proposes locally adaptive probabilistic PCA (A-PPCA) for varying subspaces.
Defines and extends Lie algebroid prolongations in convenient settings.
problem Adapting Lie algebroid prolongations to convenient settings.
method Defined and adapted Lie algebroid prolongations over fibred manifolds.
result Stability of prolongations under projective and direct limits.
Defines projective limits of local shift morphisms and applies to KdV equation.
problem Defining and studying projective limits of local shift morphisms.
method Introducing projective limits, defining shift Poisson tensors, and applying to KdV equation.
result Illustrates the application of projective limits to the KdV equation on the circle.
The study classifies hypersurfaces in quaternionic space forms with constant principal curvatures.
problem Classifying hypersurfaces in quaternionic space forms with specific curvature properties.
method Analyzing curvature-adapted real hypersurfaces in non-flat quaternionic space forms HPm and HHm. result Classification of hypersurfaces including geodesic hyperspheres, tubes, and specific examples in HPm and HHm. Paper proposes PPMM for fast estimation of large-scale OTM.
problem Estimation of large-scale optimal transport maps (OTM) is challenging due to the curse of dimensionality.
method Combines projection pursuit regression and sufficient dimension reduction to adaptively select projection directions.
result PPMM consistently estimates the most informative projection direction and weakly converges to the target OTM.