Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 35 for “"Effective Dimension"”.

  1. Methods for Sparse Functional Data

    … In the second part of this thesis, we study effective dimension reduction for regression of a scalar response on a sparse functional predictor. Our proposal estimates the effective dimension reduction space under the presence of sparse functional data, which has the important property that …

    toronto-retro Repository record for Methods for Sparse Functional Data (opens in a new tab)

  2. Fractal Dimensions in Classical and Quantum Mechanical Open Chaotic Systems

    … fractality in these systems using the concept of effective dimensions. They are defined as the dimensions far from the usually considered asymptotics of infinite evolution time $t$, infinite sample size $S$, and infinite resolution (infinitesimal box-size $varepsilon$). Yet, as we show, effective …

    qucosa-diss

  3. Directional Control of Generating Brownian Path under Quasi Monte Carlo

    … of QMC-based methods is highly dependent on the dimensionality of the problems. In particular, numerous researches have documented, under the Black-Scholes models, the critical role of the generating matrix for simulating the Brownian paths. Numerical results support the notion that generating …

    waterloo Repository record for Directional Control of Generating Brownian Path under Quasi Monte Carlo (opens in a new tab)

  4. Nonparametric Methods for Interpretable Copula Calibration and Sparse Functional Classification

    … its Fisher consistency property to estimate the effective dimension reduction space. Since only a few measurements are available for some, even all, individuals, a cumulative slicing approach is suggested to borrow information across individuals. We provide justification for validity of the …

    toronto-retro Repository record for Nonparametric Methods for Interpretable Copula Calibration and Sparse Functional Classification (opens in a new tab)

  5. Sampling the sensitivity of climate models

    … and it is widely hoped that a small number of `effective parameters' (linear combinations of the physical parameters) may dominate the model response and hence ease the task of sensitivity analysis. A new method for identifying this `effective dimension' of the model response is introduced and …

    oxford Repository record for Sampling the sensitivity of climate models (opens in a new tab)

  6. Algorithmic randomness and analysis

    … connection between analysis and the fields of effective dimension and resource bounded randomness.</p> <p>We begin with the effective dimension of Euclidean points. We show that the techniques from algorithmic information can be used successfully to study problems in fractal geometry. …

    iastate Repository record for Algorithmic randomness and analysis (opens in a new tab)

  7. Variable Selection for Skewed Clustering and Classification

    … to grow in size and complexity, the curse of dimensionality cannot be overlooked. Researchers in model-based clustering have recognized the need for effective dimension reduction techniques; as a result, many such algorithms exist to date. These algorithms, however, are often specific to …

    mcmaster Repository record for Variable Selection for Skewed Clustering and Classification (opens in a new tab)

  8. Effective Dimensionality Control in Quantitative Finance and Insurance

    It is well-known that dimension reduction techniques such as the Brownian bridge, principal component analysis, linear transformation could increase the efficiency of Quasi-Monte Carlo (QMC) methods. Caflisch et al. (1997), who introduced two notions of effective dimension known as superposition …

    waterloo Repository record for Effective Dimensionality Control in Quantitative Finance and Insurance (opens in a new tab)

  9. Statistical Inference and Computational Methods on Graphs with Geometric Structures

    … gaps. The second part studies high-dimensional random geometric graphs. It proves rate--distortion lower bounds for latent inner-product recovery and a matching spectral upper bound, up to logarithmic factors, for spherical hard-threshold graphs. The final part treats bipartite …

    gatech Repository record for Statistical Inference and Computational Methods on Graphs with Geometric Structures (opens in a new tab)

  10. The boundary method and general auction for optimal mass transportation and Wasserstein distance computation

    … than the entire continuous space, it reduces the effective dimension of the discretization. The general auction is the first relaxation method designed for compatibility with real-valued costs and weights. The boundary method is the first transport technique designed explicitly around the …

    gatech Repository record for The boundary method and general auction for optimal mass transportation and Wasserstein distance computation (opens in a new tab)

  11. Efficient High-Dimensional Approximation: ANOVA Decomposition Meets Wavelets and Random Fourier Features

    … a multivariate function from discrete d-dimensional samples. Beyond achieving accurate function recovery, we aim to enhance interpretability by identifying how individual variables and their interactions influence the target function. To this end, we develop several efficient hybrid …

    qucosa-diss

  12. Efficient similarity search with hamming distance constraints

    … problem. Hamming distance measures the number of dimensions where two vectors have different values. In applications such as pattern recognition, information retrieval, Chemoinformatics and databases, it is often needed to perform efficient Hamming distance query, which retrieves vectors in a …

    unsw Repository record for Efficient similarity search with hamming distance constraints (opens in a new tab)

  13. Exploring a formulation of lattice quantum gravity

    … space of EDT for a physical phase with 4-dimensional semiclassical geometry. We find that the parameter space contains three phases which we call the branched polymer phase, the collapsed phase, and the crinkled phase. We determine the order of the phase transition dividing the branched …

    glasgow Download PDF for Exploring a formulation of lattice quantum gravity (opens in a new tab)

  14. Conformation of Transmembrane Segments of a Protein by a Coarse Grain Model

    … factor S(q) provides an estimate of the effective dimension (D) of the protein chain which becomes globular conformation (D~3) with more connectedness in the low-temperature region and random coil (D~2) and then linear conformation (D~1) on increasing temperature further.

    usm Repository record for Conformation of Transmembrane Segments of a Protein by a Coarse Grain Model (opens in a new tab)

  15. A Geometrical Approach to Machine Learning: From Complexity Measures to Quantization

    … measure 2sED for statistical models based on the effective dimension. This new quantity provably bounds the generalization error under mild assumptions on the model. Furthermore, simulations on standard data sets and popular model architectures show that 2sED correlates well with the training …

    trento Repository record for A Geometrical Approach to Machine Learning: From Complexity Measures to Quantization (opens in a new tab)

  16. In Search of Generic Properties of Evolved Systems: From Elasticity of Proteins to Structure of Metabolic Networks

    … static protein structural data makes more effective analysis and interpretation of such data a valuable tool to supplement experimental study of protein mechanics. Although underused for protein analysis, strain is the natural quantity for studying local deformations. I calculated strain …

    rockefeller Repository record for In Search of Generic Properties of Evolved Systems: From Elasticity of Proteins to Structure of Metabolic Networks (opens in a new tab)

  17. Noise-aware generalization bound for quantum variational circuits.

    … analysis, particularly for tasks involving high-dimensional data or intricate patterns. Generalization bounds offer crucial theoretical guarantees on a quantum machine learning model’s performance on previously unseen data. However, the practical implementation of quantum machine learning models …

    baylor Repository record for Noise-aware generalization bound for quantum variational circuits. (opens in a new tab)

  18. A sparsity-free compressed sensing theory with applications in generative model recovery

    We study the problem of reconstructing a high-dimensional signal x∈ℝⁿ from a low-dimensional noisy linear measurement y=Mx+e∈ℝˡ, assuming x admits a certain structure. We model the measurement matrix as M=BA, with arbitrary B∈ℝˡˣᵐ and sub-gaussian A∈ℝᵐˣⁿ; therefore allowing for a family of random …

    ubc Repository record for A sparsity-free compressed sensing theory with applications in generative model recovery (opens in a new tab) Download PDF for A sparsity-free compressed sensing theory with applications in generative model recovery (opens in a new tab)

Page 1 of 2