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 26 for “"Matrix Rank"”.
-
Malcolmson Semigroups
In this dissertation, we introduce the matrix Malcolmson semigroup and the finitely presented module Malcolmson semigroup for unital rings, as algebraic analogues of the Cuntz semigroup. These two semigroups are shown to have isomorphic Grothendieck group in general and be isomorphic for von …
-
Investigating Quantum Computing via Algebraic and Logical Tools
… and two bedrock mathematical tasks: computing matrix rank and counting solutions to quadratic polynomials (both over the field F2). Precisely, it uses quadratic forms to obtain a strong simulation (i.e. computing the probability for any input and output) of stabilizer circuits.Our results …
-
Learning with Less: Low-rank Dynamics, Communication, and Introspection in Machine Learning
… learning, and the underlying role that the matrix rank of utilized learning statistics plays in these algorithms. We show that this new perspective on machine learning optimization provides benefits in terms of communication-efficient federated learning algorithms, as well as novel insights …
-
Kointegruotumo tikrinimas Bajeso metodais /
… distributions, which are used to calculate rank probabilities of cointegration matrix. In the method section we will calculate probabilities of cointegration matrix rank for OMX Vilnius and OMX Ryga stock indexes, using Bayesian method. Also we will compare obtained results with Johansen …
-
Kointegruotumo tikrinimas Bajeso metodais /
… distributions, which are used to calculate rank probabilities of cointegration matrix. In the method section we will calculate probabilities of cointegration matrix rank for OMX Vilnius and OMX Ryga stock indexes, using Bayesian method. Also we will compare obtained results with Johansen …
-
Polynomial optimization: structures, algorithms, and engineering applications
… question asserting that the computation of the matrix $2 \mapsto 4$ norm is NP-hard in general. Then we proceed to studying polynomial function in random variables and establish a series of fundamental probability inequalities. Similar to the relationship between the symmetric matrices and the …
-
Algebraic constraints for linear acyclic causal models
… second- and third-order moments of X, which drop rank only if certain visible structures can be found in the graph G. This correspondence has both statistical and combinatorial interpretations. Given enough of these matrix rank constraints, we can completely determine the graph. This …
-
Modeling, learning, and inference of high-dimensional asynchronous event data
… information diffusions. We then develop the low-rank Hawkes process to describe the recurrent temporal interactions among different types of entities. We also build a link between the recurrent neural network and the temporal point process to learn a general representation of the influence from …
-
Building a Nonparametric Model After Dimension Reduction
… on eigenvalues, a modified Wald-type test, and a matrix rank test. These tests are motivated from different aspects of the problem and have their own strength and weakness. We discuss and compare these tests both theoretically and through Monte Carlo simulations, based on which specific …
-
Application of horsepower absorption techniques to turboshaft engine testing
… is an attempt to develop a standardized matrix for identifying the optimal horsepower absorber to utilize for a particular turboshaft engine test. Previous efforts identified optimal absorbers within a given family of devices for a particular facility or engine type. Herein, after a …
-
Out-Tournament Adjacency Matrices with Equal Ranks
… real, nonnegative integer, Boolean, and term ranks. Relatively little is known about the corresponding adjacency matrix ranks of local out-tournaments, a larger family of digraphs containing the class of tournaments. Based on each of several structural theorems from Bang-Jensen, Huang, and …
-
Matrix Formulations of Matching Problems
… in a directed graph can be formulated as matrix rank problems. The Tutte matrix, introduced by Tutte as a representation of an undirected graph, has rank equal to the maximum number of vertices covered by a matching in the associated graph. The branching matrix, a representation of a …
-
ShuFFLE: Automated Framework for HArdware Accelerated Iterative Big Data Analysis
… to handle because of the complexity of known matrix transformation algorithms and the inseparability of non-sparse correlations. ShuFFLE learns the properties of the Gram matrices and their rank for each particular application domain. It then utilizes the underlying properties for …
-
Learning structured matrices in high dimensions: Low rank estimation and structured graphical models
The topic of learning matrix structures in the emph{high-dimensional statistical setting} has received a lot of attention in machine learning, statistics and signal processing literature. High dimensional setting refers to problems that have more parameters to estimate than samples or measurements. …
-
QUANTUM INFORMATION SCRAMBLING AND PROTECTION IN MANY-BODY SYSTEM
… dual. The third part of the thesis presents a matrix model with a large matrix rank N that belongs to the class of approximate quantum error correction codes. We investigate its thermal stability by coupling it to a thermal bath and demonstrate that it behaves as a self-correcting quantum …
-
Quantum Algorithms for Memoryless Search and Perfect Matching
… perfect matchings to deciding whether a matrix has nonzero determinant. The key part of our algorithm is a new span program that can decide whether a matrix is singular. Our span program has a simple structure and its witness size matches that of a related span program by Belovs for …
-
Essays on price discovery in financial markets
… demonstrate that the asset prices autoregressive matrix rank and the speed of reversion towards the long-term equilibrium are related to the market liquidity, unlike the cointegrating vector. Our empirical application to the soybean complex, where we control for volatility, supports our …
-
Sparse Recovery, Classification, and Data Compression via Improved Maximum Feasible Subsystem Algorithms
… (CS) and data compression via Nonnegative Matrix Factorization (NNMF) for the first time in this thesis. In CS, the new algorithm can successfully recover real-world signals such as speech and Electrocardiogram (ECG) signals that have been more greatly compressed than existing methods can …
-
On Graph Coloring, Max Cut, and Semidefinite Rank
… the interplay between semidefinite programming, matrix rank, and graph coloring. Karger, Motwani, and Sudan give a vector program in which a coloring of a graph can be encoded as a semidefinite matrix of low rank. By complementary slackness conditions of semidefinite programming, if an optimal …
-
q-Polymatroids and their application to rank-metric codes.
… closely related to the theory of linear vector rank metric codes. This relation was then generalized to q-polymatroids and linear matrix rank metric codes. This dissertation aims at developing the theory of q-(poly)matroid and its relation to the theory of rank metric codes. In a first part, we …
Page 1 of 2