We study the problem of variable selection in convex nonparametric regression. Under the assumption that the true regression function is convex and sparse, we develop a screening procedure to select a subset of variables that contains the relevant variables. Our approach is a two-stage quadratic programming method that…
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,742 papers · 148 categories
Trend · papers per month
48 results for “one-dimensional regression”
BFCR detects anomalies in 1D data efficiently.
problem Anomaly detection in 1D data.
method Braced Fourier Continuation and Regression (BFCR) for efficient anomaly detection.
result BFCR trend lines effectively detect anomalies in 1D data.
CNNs outperform standard chemometric methods for spectral data classification.
problem Reducing the need for pre-processing steps in spectral data analysis.
method Convolutional neural networks (CNNs) compared with SVMs and PLSR for classification and regression of spectral data.
result CNNs outperform standard chemometric methods, especially for classification tasks.
A new learning method using hyperbolic geometry for class labels.
problem Class label representation and learning in machine learning.
method Hyperbolic Prototype Learning with a new loss function based on hyperbolic geometry.
result Hyperbolic Prototype Learning is equivalent to logistic regression in the one-dimensional case.
In this paper, we consider one dimensional (shallow) ReLU neural networks in which weights are chosen randomly and only the terminal layer is trained. First, we mathematically show that for such networks L2-regularized regression corresponds in function space to regularizing the estimate's second derivative for fairly …
Method uses DNNs to approximate functions with specific asymptotic behavior.
problem Approximating functions with given asymptotic behavior.
method Specifically constructed terms combined with unconstrained DNN.
result Enforcing asymptotic behavior leads to better approximation and faster convergence.
Neural networks perform differently when regression is treated as classification.
problem Understanding why neural networks perform better when regression is treated as classification.
method Analyzing two-layer ReLU networks and their feature spaces, focusing on the cross entropy loss vs. square loss.
result The support of the measure induced by the square loss differs from that of the cross entropy loss, indicating optimization difficulties.
Deep single-index Fréchet regression for metric space-valued outputs
problem Predicting outputs in non-Euclidean spaces
method DeSI (Deep Single-Index Fréchet Regression)
result Interpretable index direction for inputs
Study one-dimensional topological theories with linear generating functions.
problem Understanding one-dimensional topological theories with defects.
method Construct bases of hom spaces for decorated unoriented one-dimensional cobordisms.
result Gram determinant and linear generating functions constructed.
Proposes a new regression method using -norms for non-Gaussian noise.
problem Non-Gaussian noise in residuals affects the performance of local least squares regression.
method Introduces local polynomial -norm regression, replacing weighted least squares with weighted -norm estimation.
result Demonstrates superior performance over local least squares in one-dimensional data and higher dimensions.
A new method estimates nonlinear functions without the curse of dimensionality.
problem Estimating nonlinear functions in high-dimensional spaces.
method Conditional regression for a specific nonlinear model.
result Achieves optimal min-max rate for non-parametric regression in one dimension.
NQE uses quantile regression for fast SBI with cubic Hermite splines.
problem Efficient Bayesian inference for complex models with limited data.
method Neural Quantile Estimation (NQE) learns quantiles autoregressively and interpolates them using cubic Hermite splines.
result NQE achieves state-of-the-art performance on various benchmark problems.
We propose methods for estimating correspondence between two point sets under the presence of outliers in both the source and target sets. The proposed algorithms expand upon the theory of the regression without correspondence problem to estimate transformation coefficients using unordered multisets of covariates and r…
The effectiveness of supervised learning techniques has made them ubiquitous in research and practice. In high-dimensional settings, supervised learning commonly relies on dimensionality reduction to improve performance and identify the most important factors in predicting outcomes. However, the economic importance of …
RLF uses Riemann-Lebesgue cutting for better regression.
problem Improving regression accuracy through novel tree splitting.
method Develops Riemann-Lebesgue Tree (RLT) for partitioning response intervals.
result RLF achieves larger variance reduction compared to CART.
In this paper we discuss Bayesian nonconvex penalization for sparse learning problems. We explore a nonparametric formulation for latent shrinkage parameters using subordinators which are one-dimensional Lévy processes. We particularly study a family of continuous compound Poisson subordinators and a family of discrete…
We found a new simple family of Cantor sets whose projections are one-dimensional.
problem Finding simple Cantor sets with specific projection properties.
method Developed a new series of self-similar Cantor sets in .
result All projections of these new Cantor sets are connected and one-dimensional.
The paper develops exact and approximate conformal inference methods for multi-output regression.
problem Uncertainty quantification in multi-output regression predictions.
method Exact derivations and approximations of conformal inference p-values for linear multi-output predictors, and efficient methods for nonlinear predictors.
result Efficient methods for approximating conformal prediction regions for multi-output predictors, both linear and nonlinear.
The popularity of algorithms based on Extreme Learning Machine (ELM), which can be used to train Single Layer Feedforward Neural Networks (SLFN), has increased in the past years. They have been successfully applied to a wide range of classification and regression tasks. The most commonly used methods are the ones based…
Study of one-dimensional non-Hausdorff manifolds and their quotient to CW complexes.
problem Understanding and characterizing one-dimensional non-Hausdorff manifolds.
method Analyzing properties of connected non-Hausdorff manifolds and their quotient spaces to CW complexes.
result Existence of a quotient map from a connected non-Hausdorff manifold to an open one-dimensional CW complex.
Distributed sensors compress and send features to a fusion center for linear regression.
problem Efficiently compress and transmit features from distributed sensors to a fusion center under varying communication constraints.
method Designs a distributed and adaptive feature compression scheme using optimal quantizers and simple adaptive strategies.
result Demonstrates improved inference performance through simulated experiments.
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.
A new metric-based principal curve method learns 1D manifolds from spatial data.
problem Learning 1D manifolds from spatial data.
method Metric-based Principal Curve (MPC) approach.
result The method effectively learns the shape of 1D manifolds from synthetic and real datasets.
New algorithms accelerate SVGD convergence using deep unfolding.
problem Improving the speed of SVGD convergence.
method Integrating deep unfolding into SVGD for parameter learning.
result Proposed algorithms achieve faster convergence in various tasks.
Exact and scalable algorithm for Gaussian process regression with Matérn correlations.
problem Efficient Gaussian process regression with Matérn correlations.
method Novel kernel packet theory and sparse representation of covariance matrix.
result Significantly superior to existing alternatives in computational time and predictive accuracy.
Understanding Machine-learned Density Functionalsphysics.chem-ph
Kernel ridge regression is used to approximate the kinetic energy of non-interacting fermions in a one-dimensional box as a functional of their density. The properties of different kernels and methods of cross-validation are explored, and highly accurate energies are achieved. Accurate {\em constrained optimal densitie…
This paper characterizes how randomized neural networks generalize well in multi-dimensional tasks.
problem Understanding the generalization of randomized neural networks in multi-dimensional tasks.
method Characterizes RSNs as an IGAM formalized by an optimization problem with a regularization functional and loss.
result RSNs generalize well in multi-dimensional tasks, akin to spline regression under certain conditions.
Deep heteroskedastic models overfit, showing a phase transition with regularization strength.
problem Overfitting in deep heteroskedastic regression models.
method Theoretical framework based on statistical field theory, empirical verification, and hyperparameter simplification.
result A phase transition in model behavior with varying regularization strength.
The paper predicts responses on out-of-sample nodes using latent positions on unknown curves.
problem Predicting responses on out-of-sample nodes with latent positions on unknown curves.
method Manifold learning and graph embedding technique using latent positions.
result Convergence guarantees for predicting responses on out-of-sample nodes.
We prove that for compact, non-contractible, one dimensional geodesic spaces, a version of the marked length spectrum conjecture holds. For a compact one dimensional geodesic space X, we define a subspace Conv(X). When X is non-contractible, we show that X deformation retracts to Conv(X). If two such spaces X, Y have t…
Random projections improve GP regression performance, reducing high-dimensional inputs to 1D.
problem Gaussian processes struggle with high-dimensional inputs, leading to overfitting and high computational cost.
method Use additive sums of kernels operating on random projections of inputs.
result Predictive performance converges to full-dimensional kernel performance with increasing projections, even in 1D.
One-dimensional crystals have convex shapes under certain conditions.
problem Determining if one-dimensional crystals have convex shapes.
method Analyzing the free energy under mass constraints and convexity assumptions.
result In one dimension, crystals have convex shapes under given conditions.
Smooth algebra analysis for one-dimensional singular foliations.
problem Analyzing smooth algebras of one-dimensional singular foliations.
method Analyzing natural ideals and using Dixmier-Malliavin theorem.
result Smooth algebras of one-dimensional singular foliations are pairwise nonisomorphic.
We classify the harmonic morphisms with one-dimensional fibres (1) from real-analytic conformally-flat Riemannian manifolds of dimension at least four, and (2) between conformally-flat Riemannian manifolds of dimensions at least three.
It is generally understood that a given one-dimensional diffusion may be transformed by Cameron-Martin-Girsanov measure change into another one-dimensional diffusion with the same volatility but a different drift. But to achieve this we have to know that the change-of-measure local martingale that we write down is a tr…
We provide a comprehensive overview and tooling for GP modeling with non-Gaussian likelihoods using state space methods. The state space formulation allows for solving one-dimensional GP models in time and memory complexity. While existing literature has focused on the connection between GP regression …
Gradient descent fails to train two-layer ReLU networks, leading to poor performance.
problem Gradient descent training of two-layer ReLU networks initialized by He et al. (2015) fails to find optimal solutions.
method Gradient descent on a least-squares loss for training two-layer (Leaky)ReLU networks.
result Gradient descent only finds bad local minima, leading to linear regression for non-linear target functions.
Reduces function approximation dimensions from high to low with sparse data.
problem Function approximation from sparse data.
method Nonlinear Level Set Learning (NLL) with geometric information.
result Reduces input dimension to theoretical lower bound with minor accuracy loss.
Many computer vision and medical imaging problems are faced with learning from large-scale datasets, with millions of observations and features. In this paper we propose a novel efficient learning scheme that tightens a sparsity constraint by gradually removing variables based on a criterion and a schedule. The attract…
The paper addresses misspecification in econometric models of discrete unobserved heterogeneity.
problem Misspecification in econometric models of discrete unobserved heterogeneity.
method Generalizing previous approaches to allow multiple latent variables, developing inference results for a k-means style estimator, and proposing information criteria for model selection.
result Over-fitting can be severe in k-means style estimators when the number of clusters is over-specified.
We obtain a deterministic characterisation of the \emph{no free lunch with vanishing risk}, the \emph{no generalised arbitrage} and the \emph{no relative arbitrage} conditions in the one-dimensional diffusion setting and examine how these notions of no-arbitrage relate to each other.
In this paper we continue our studies of the one dimensional conformal metric flows, which were introduced in [8]. In this part we mainly focus on evolution equations involving fourth order derivatives. The global existence and exponential convergence of metrics for the 1-Q and 4-Q flows are obtained.
The paper studies stochastic gradient descent with infinite variance gradients.
problem Theoretical properties of SGD with infinite variance gradients.
method Establish asymptotic behavior of SGD with infinite variance gradients.
result Asymptotic distribution of SGD is characterized as a stationary distribution of an Ornstein-Uhlenbeck process driven by a stable Lévy process.
We prove that, from an Einstein manifold of dimension greater than or equal to five, there are just two types of harmonic morphism with one-dimensional fibres. This generalizes a result of R.L. Bryant who obtained the same conclusion under the assumption that the domain has constant curvature.
The study examines different types of equilibria for stopping problems in one-dimensional diffusion processes.
problem Characterizing and comparing different types of equilibria for time-inconsistent stopping problems.
method Analyzes log sub-additive discount functions and one-dimensional diffusion processes to derive necessary and sufficient conditions for weak equilibria and other types of equilibria.
result Conditions for weak equilibria and their implications for other types of equilibria are provided.
LatentNN corrects neural network attenuation bias in astronomical data.
problem Neural networks underestimate extreme values due to measurement errors.
method Jointly optimizes network parameters and latent input values.
result LatentNN reduces attenuation bias across various signal-to-noise ratios.
Random Planted Forest interprets tree-based models by keeping some splits, leading to more interpretable predictions.
problem Estimating the unknown regression function from lower-order interaction terms.
method Modifying the random forest algorithm by keeping certain leaves instead of deleting them, resulting in non-binary trees called planted trees.
result The random planted forest achieves asymptotically optimal convergence rates up to a logarithmic factor when the interaction bound is low.
Suppose that f and g are Markov surjections, each defined on a wedge of circles, each fixing the branch point and having the branch point as the only critical value. We show that if the points in the inverse limit spaces associated with f and g corresponding to the branch point are distinguished then these inverse limi…