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 46 for “"Optimal Approximation"”.
-
OPTIMAL APPROXIMATION ALGORITHMS FOR DIGITAL FILTER DESIGN
Several new algorithms are presented for the optimal approximation and design of various classes of digital filters. An iterative algorithm is developed for the efficient design of unconstrained and constrained infinite impulse response (IIR) digital filters. Both in the unconstrained and …
-
OPTIMAL APPROXIMATION SPACES FOR SOLVING PROBLEMS WITH ROUGH COEFFICIENTS
… Another is that it uses polynomials as the approximation basis functions. Commonly, polynomials are also used by other numerical methods for partial differential equations, such as the finite difference method and the spectral method. Nevertheless, polynomial approximations are not always …
-
Optimal Approximation of High-dimensional Functions on Smooth Manifolds Using Deep ReLU Neural Networks
… In this dissertation, we focus on the approximation theory of neural networks to explain this phenomenon. First, we construct a version of the Johnson-Lindenstrass Lemma on the smooth manifold to analyze the approximation of $\beta$-smooth H\"older functions defined on a $d$-dimensional …
-
Bridging the Gap Between Approximation and Learning via Optimal Approximation by ReLU MLPs of Maximal Regularity
… by the seemingly opposing perspectives of approximation or learning theory. The former advocates for large/expressive models that need not generalize, while the latter considers classes that generalize but may be too small/constrained to be universal approximators. Motivated by real−world …
-
Design of control systems to meet l(infinity) specifications
… many known results on this problem: existence of optimal compensators, FIR sub-optimal approximation, and super-optimal approximation. The specifications in the remaining two problems are based on $l\sb\infty$ measures of weighted disturbances and errors; these weights can be chosen such that …
-
On the computational asymptotics of Gaussian variational inference
… methods that constructs a Bayesian posterior approximation by minimizing a discrepancy to the true posterior within a pre-specified family. This converts Bayesian inference into an optimization problem, enabling the use of simple and scalable stochas- tic optimization algorithms. However, a …
-
Higher Order Immersed Finite Element Methods for Interface Problems
… conforming IFE space in two dimensions with optimal approximation capabilities, alongside with applications to the elliptic interface problem and the hyperbolic interface problem. In the first part, we discuss a general m-th degree IFE space for one dimensional interface problems with many …
-
Parameter Identification for the Preisach Model of Hysteresis
… the utility of this method. In addition, the approximation of singular Preisach measures is explored. The types of singularities investigated are characterized by non-zero initial slopes of reversal curves. The difficulties of finding the “optimal” approximation in this case are detailed as …
-
DEEP NEURAL NETWORK APPROXIMATION VIA FUNCTION COMPOSITIONS
… learning problems. This thesis focuses on the approximation theory of deep neural networks. We provide (nearly optimal) approximation error estimates in terms of the width and depth when constructing ReLU networks, via the idea of function compositions, to uniformly approximate polynomials, …
-
Error estimates for numerical solutions of one- and two-dimensional integral equations
… interpolation in the numerical approximation. The work is motivated by the aim of reducing errors of BEM methods for low-degree interpolating polynomials, without significantly increasing the computational cost associated with higher-degree interpolation. The present thesis …
-
Automatic Design Space Exploration of Fault-tolerant Embedded Systems Architectures
… empirically evaluate the performance of a near-optimal approximation variation that allows us to solve the problem even when the instance size makes it intractable in terms of computing resources. The efficiency and scalability of this method is validated with a series of experiments of …
-
Frequency-Domain Learning of Dynamical Systems From Time-Domain Data
… Then, we develop an algorithm that performs optimal-H2 approximation using purely time-domain data; thus significantly extending the applicability of H2-optimal approximation without a need for frequency domain sampling. We also investigate how well other established frequency-based ROM …
-
System Identification, Uncertainty Quantification, and Inference of Constitutive Relations in Electrochemistry
… using a so-called closure condition. The pair approximation is the most common form of such closure. Here, we consider its generalization, termed the “optimal approximation”, which we calibrate using a robust data-driven strategy. The form of the obtained optimal approximation allows us to …
-
Transfer-of-approximation Approaches for Subgrid Modeling
… two Galerkin methods based on the transfer-of-approximation property for static and dynamic acoustic boundary value problems in seismic applications. For problems with heterogeneous coefficients, the polynomial finite element spaces are no longer optimal unless special meshing techniques are …
-
Insights into neural network learning of structured models : optimization, architectures, and scientific surrogates
… of the underlying Gram matrix guarantees near-optimal approximation error at a fraction of the computational and memory cost, enabling efficient large-scale training with state-of-the-art accuracy. In more general settings, working in function space, we show that the generalized Gauss-Newton …
-
Quantile Inference and Change Point Test under Time Series Non-stationarity
… New uniform Bahadur representations and Gaussian approximation schemes are established for a wide class of non-stationary and long memory linear processes. Furthermore, an asymptotic distributional theory is developed for the maxima of a class of non-stationary long memory Gaussian processes. With …
-
Rethinking Resource Allocation: Fairness and Computability
… is computationally hard. Consequently, several approximation techniques were proposed to ensure all agents receive a fraction of their MMS. We propose an orthogonal approximation which aims to guarantee MMS for a fraction of the agents. We construct instances where any optimal approximation …
-
Least-squares methods for computational electromagnetics
… we present and analyze a new methodology for approximation of the time-harmonic Maxwell's equations. It is an extension of the negative-norm least-squares finite element approach which has been applied successfully to a variety of other problems. The main advantages of our method are that it …
-
Rough Sets, Similarity, and Optimal Approximations
… years, and the basic concepts of lower and upper approximations have been analysed in detail, yet nowhere has the idea of an `optimal' rough approximation been proposed or investigated. In this thesis, several concepts are used in proposing a generalized definition: measures, rough sets, …
-
Multi-Agent Decision Systems: From Computational Social Choice to Privacy-Preserving Distributed Learning in Complex Environments
… veto voting rules, we develop a polynomial-time approximation scheme leveraging novel integer programming formulations and n-fold integer programming techniques. It can efficiently compute and find near-optimal solutions. This dissertation also investigates honeypot deployment strategies as …
Page 1 of 3