scholarly journals Multiscale regression on unknown manifolds

2022 ◽  
Vol 4 (4) ◽  
pp. 1-25
Author(s):  
Wenjing Liao ◽  
◽  
Mauro Maggioni ◽  
Stefano Vigogna ◽  
◽  
...  

<abstract><p>We consider the regression problem of estimating functions on $ \mathbb{R}^D $ but supported on a $ d $-dimensional manifold $ \mathcal{M} ~~\subset \mathbb{R}^D $ with $ d \ll D $. Drawing ideas from multi-resolution analysis and nonlinear approximation, we construct low-dimensional coordinates on $ \mathcal{M} $ at multiple scales, and perform multiscale regression by local polynomial fitting. We propose a data-driven wavelet thresholding scheme that automatically adapts to the unknown regularity of the function, allowing for efficient estimation of functions exhibiting nonuniform regularity at different locations and scales. We analyze the generalization error of our method by proving finite sample bounds in high probability on rich classes of priors. Our estimator attains optimal learning rates (up to logarithmic factors) as if the function was defined on a known Euclidean domain of dimension $ d $, instead of an unknown manifold embedded in $ \mathbb{R}^D $. The implemented algorithm has quasilinear complexity in the sample size, with constants linear in $ D $ and exponential in $ d $. Our work therefore establishes a new framework for regression on low-dimensional sets embedded in high dimensions, with fast implementation and strong theoretical guarantees.</p></abstract>

2010 ◽  
Vol 20 (03) ◽  
pp. 177-192 ◽  
Author(s):  
JOCHEN EINBECK ◽  
LUDGER EVERS ◽  
BENEDICT POWELL

We consider principal curves and surfaces in the context of multivariate regression modelling. For predictor spaces featuring complex dependency patterns between the involved variables, the intrinsic dimensionality of the data tends to be very small due to the high redundancy induced by the dependencies. In situations of this type, it is useful to approximate the high-dimensional predictor space through a low-dimensional manifold (i.e., a curve or a surface), and use the projections onto the manifold as compressed predictors in the regression problem. In the case that the intrinsic dimensionality of the predictor space equals one, we use the local principal curve algorithm for the the compression step. We provide a novel algorithm which extends this idea to local principal surfaces, thus covering cases of an intrinsic dimensionality equal to two, which is in principle extendible to manifolds of arbitrary dimension. We motivate and apply the novel techniques using astrophysical and oceanographic data examples.


2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Hamidreza Abbaspourazad ◽  
Mahdi Choudhury ◽  
Yan T. Wong ◽  
Bijan Pesaran ◽  
Maryam M. Shanechi

AbstractMotor function depends on neural dynamics spanning multiple spatiotemporal scales of population activity, from spiking of neurons to larger-scale local field potentials (LFP). How multiple scales of low-dimensional population dynamics are related in control of movements remains unknown. Multiscale neural dynamics are especially important to study in naturalistic reach-and-grasp movements, which are relatively under-explored. We learn novel multiscale dynamical models for spike-LFP network activity in monkeys performing naturalistic reach-and-grasps. We show low-dimensional dynamics of spiking and LFP activity exhibited several principal modes, each with a unique decay-frequency characteristic. One principal mode dominantly predicted movements. Despite distinct principal modes existing at the two scales, this predictive mode was multiscale and shared between scales, and was shared across sessions and monkeys, yet did not simply replicate behavioral modes. Further, this multiscale mode’s decay-frequency explained behavior. We propose that multiscale, low-dimensional motor cortical state dynamics reflect the neural control of naturalistic reach-and-grasp behaviors.


2021 ◽  
Vol 13 (11) ◽  
pp. 2171
Author(s):  
Yuhao Qing ◽  
Wenyi Liu ◽  
Liuyan Feng ◽  
Wanjia Gao

Despite significant progress in object detection tasks, remote sensing image target detection is still challenging owing to complex backgrounds, large differences in target sizes, and uneven distribution of rotating objects. In this study, we consider model accuracy, inference speed, and detection of objects at any angle. We also propose a RepVGG-YOLO network using an improved RepVGG model as the backbone feature extraction network, which performs the initial feature extraction from the input image and considers network training accuracy and inference speed. We use an improved feature pyramid network (FPN) and path aggregation network (PANet) to reprocess feature output by the backbone network. The FPN and PANet module integrates feature maps of different layers, combines context information on multiple scales, accumulates multiple features, and strengthens feature information extraction. Finally, to maximize the detection accuracy of objects of all sizes, we use four target detection scales at the network output to enhance feature extraction from small remote sensing target pixels. To solve the angle problem of any object, we improved the loss function for classification using circular smooth label technology, turning the angle regression problem into a classification problem, and increasing the detection accuracy of objects at any angle. We conducted experiments on two public datasets, DOTA and HRSC2016. Our results show the proposed method performs better than previous methods.


2017 ◽  
Vol 19 (12) ◽  
pp. 125012 ◽  
Author(s):  
Carlos Floyd ◽  
Christopher Jarzynski ◽  
Garegin Papoian

2021 ◽  
Author(s):  
Corson N Areshenkoff ◽  
Daniel J Gale ◽  
Joe Y Nashed ◽  
Dominic Standage ◽  
John Randall Flanagan ◽  
...  

Humans vary greatly in their motor learning abilities, yet little is known about the neural mechanisms that underlie this variability. Recent neuroimaging and electrophysiological studies demonstrate that large-scale neural dynamics inhabit a low-dimensional subspace or manifold, and that learning is constrained by this intrinsic manifold architecture. Here we asked, using functional MRI, whether subject-level differences in neural excursion from manifold structure can explain differences in learning across participants. We had subjects perform a sensorimotor adaptation task in the MRI scanner on two consecutive days, allowing us to assess their learning performance across days, as well as continuously measure brain activity. We find that the overall neural excursion from manifold activity in both cognitive and sensorimotor brain networks is associated with differences in subjects' patterns of learning and relearning across days. These findings suggest that off-manifold activity provides an index of the relative engagement of different neural systems during learning, and that intersubject differences in patterns of learning and relearning across days are related to reconfiguration processes in cognitive and sensorimotor networks during learning.


2020 ◽  
Author(s):  
Wei Guo ◽  
Jie J. Zhang ◽  
Jonathan P. Newman ◽  
Matthew A. Wilson

AbstractLatent learning allows the brain the transform experiences into cognitive maps, a form of implicit memory, without reinforced training. Its mechanism is unclear. We tracked the internal states of the hippocampal neural ensembles and discovered that during latent learning of a spatial map, the state space evolved into a low-dimensional manifold that topologically resembled the physical environment. This process requires repeated experiences and sleep in-between. Further investigations revealed that a subset of hippocampal neurons, instead of rapidly forming place fields in a novel environment, remained weakly tuned but gradually developed correlated activity with other neurons. These ‘weakly spatial’ neurons bond activity of neurons with stronger spatial tuning, linking discrete place fields into a map that supports flexible navigation.


2018 ◽  
Vol 21 (5) ◽  
pp. 824-837 ◽  
Author(s):  
Jian Huang ◽  
Gordon McTaggart-Cowan ◽  
Sandeep Munshi

This article describes the application of a modified first-order conditional moment closure model used in conjunction with the trajectory-generated low-dimensional manifold method in large-eddy simulation of pilot ignited high-pressure direct injection natural gas combustion in a heavy-duty diesel engine. The article starts with a review of the intrinsic low-dimensional manifold method for reducing detailed chemistry and various formulations for the construction of such manifolds. It is followed by a brief review of the conditional moment closure method for modelling the interaction between turbulence and combustion chemistry. The high computational cost associated with the direct implementation of the basic conditional moment closure model was discussed. The article then describes the formulation of a modified approach to solve the conditional moment closure equation, whose reaction source terms for the conditional mass fractions for species were obtained by projecting the turbulent perturbation onto the reaction manifold. The main model assumptions were explained and the resulting limitations were discussed. A numerical experiment was conducted to examine the validity the model assumptions. The model was then implemented in a combustion computational fluid dynamics solver developed on an open-source computational fluid dynamics platform. Non-reactive jet simulations were first conducted and the results were compared to the experimental measurement from a high-pressure visualization chamber to verify that the jet penetration under engine relevant conditions was correctly predicted. The model was then used to simulate natural gas combustion in a heavy-duty diesel engine equipped with a high-pressure direct injection system. The simulation results were compared with the experimental measurement from a research engine to verify the accuracy of the model for both the combustion rate and engine-out emissions.


Symmetry ◽  
2020 ◽  
Vol 12 (3) ◽  
pp. 434 ◽  
Author(s):  
Huilin Ge ◽  
Zhiyu Zhu ◽  
Kang Lou ◽  
Wei Wei ◽  
Runbang Liu ◽  
...  

Infrared image recognition technology can work day and night and has a long detection distance. However, the infrared objects have less prior information and external factors in the real-world environment easily interfere with them. Therefore, infrared object classification is a very challenging research area. Manifold learning can be used to improve the classification accuracy of infrared images in the manifold space. In this article, we propose a novel manifold learning algorithm for infrared object detection and classification. First, a manifold space is constructed with each pixel of the infrared object image as a dimension. Infrared images are represented as data points in this constructed manifold space. Next, we simulate the probability distribution information of infrared data points with the Gaussian distribution in the manifold space. Then, based on the Gaussian distribution information in the manifold space, the distribution characteristics of the data points of the infrared image in the low-dimensional space are derived. The proposed algorithm uses the Kullback-Leibler (KL) divergence to minimize the loss function between two symmetrical distributions, and finally completes the classification in the low-dimensional manifold space. The efficiency of the algorithm is validated on two public infrared image data sets. The experiments show that the proposed method has a 97.46% classification accuracy and competitive speed in regards to the analyzed data sets.


Sign in / Sign up

Export Citation Format

Share Document