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 20 for “"Minorization"”.

  1. Mixture-Based Clustering for High-Dimensional Count Data Using Minorization-Maximization Approaches

    … where the mixture parameters are estimated using minorization-maximization algorithm. Moreover, we propose an online learning technique for unsupervised clustering based on a mixture of Neerchal- Morel distributions. While the novel mixture model is able to capture overdispersion due to a weight …

    concordia Download PDF for Mixture-Based Clustering for High-Dimensional Count Data Using Minorization-Maximization Approaches (opens in a new tab)

  2. Mixture-Based Clustering for High-Dimensional Count Data Using Minorization-Maximization Approaches

    … where the mixture parameters are estimated using minorization-maximization algorithm. Moreover, we propose an online learning technique for unsupervised clustering based on a mixture of Neerchal- Morel distributions. While, the novel mixture model is able to capture overdispersion due to a weight …

    concordia Download PDF for Mixture-Based Clustering for High-Dimensional Count Data Using Minorization-Maximization Approaches (opens in a new tab)

  3. Modelling Outcomes in Canadian Professional Football via Generalized Bradley-Terry Models

    … predictions, alongside derivations of well-known minorization-maximization (MM) algorithms and descriptions Artificial Neural Net- work (ANN) processes that can be leveraged to estimate such models' parameters. Various candidate models, parameterized by regular-season CFL game outcomes from …

    regina Repository record for Modelling Outcomes in Canadian Professional Football via Generalized Bradley-Terry Models (opens in a new tab) Download PDF for Modelling Outcomes in Canadian Professional Football via Generalized Bradley-Terry Models (opens in a new tab)

  4. Convergence Rates for Stationary Distributions of Semistochastic Processes

    … our bounds on convergence rates by establishing minorization and drift conditions. Specific examples are considered in cases of bounded and unbounded state spaces. We also discuss a method of exact computation for the stationary distributions of a certain class of semistochastic processes. An …

    oklahoma-thes Repository record for Convergence Rates for Stationary Distributions of Semistochastic Processes (opens in a new tab) Restricted access

  5. Les structures sociales traditionnelles, les réfugiés et la dégradation forestière dans la préfecture de Guéckédou, République de Guinée.

    … identity crisis from the fact of Kissi's "minorization" due of refugees' invasion. Because those structures are prohibited by the administration contributes to weaken them. So, to reach a better management of resources in Gueckedou prefecture, it will be useful to restore traditional …

    ottawa-retro Repository record for Les structures sociales traditionnelles, les réfugiés et la dégradation forestière dans la préfecture de Guéckédou, République de Guinée. (opens in a new tab)

  6. Nonparametric inference on monotone functions, with applications to observational studies

    … estimators. This broad class allows the minorization operation to be performed on a data-dependent transformation of the domain. We use our general results from the second setting to perform a detailed study of generalized Grenander-type estimation of a monotone covariate-adjusted …

    washington Repository record for Nonparametric inference on monotone functions, with applications to observational studies (opens in a new tab)

  7. A UNIFIED BAYESIAN FRAMEWORK FOR UNSUPERVISED LEARNING: FROM MIXTURE MODEL ALGORITHMS TO LARGE LANGUAGE MODEL PERSONALIZATION

    … parametrization of the DCNM, we derive minorization-maximization equations for finite mixture models that guarantee monotone likelihood ascent, are analytically tractable without extensive Hessian computations, and are robust to initialization. Model selection is addressed via the …

    concordia Download PDF for A UNIFIED BAYESIAN FRAMEWORK FOR UNSUPERVISED LEARNING: FROM MIXTURE MODEL ALGORITHMS TO LARGE LANGUAGE MODEL PERSONALIZATION (opens in a new tab)

  8. Regularized Learning of High-dimensional Sparse Graphical Models

    … algorithm is devised by using a novel coordinate-minorization-ascent algorithm. Asymptotic oracle properties of our proposed estimator are established with NP-dimensionality. We demonstrate its finite sample performance via simulation studies and real applications to study the Human …

    umn Repository record for Regularized Learning of High-dimensional Sparse Graphical Models (opens in a new tab)

  9. A Generalized Lyapunov Construction for Proving Stabilization by Noise

    … of a super Lyapunov function, along with a minorization condition, implies that the corresponding system converges to a unique invariant probability measure at an exponential rate that is independent of the initial condition.</p>

    duke Repository record for A Generalized Lyapunov Construction for Proving Stabilization by Noise (opens in a new tab)

  10. Fractional Programming for Communication System Design

    … proposed FP methods by connecting them to the minorization-maximization (MM) theory. On the application side of FP in communication system design, this thesis begins with the continuous optimization of transmit powers and beamforming vectors in the signal-to-interference-plus-noise ratio (SINR) …

    toronto-retro Repository record for Fractional Programming for Communication System Design (opens in a new tab)

  11. Optimal Zero-Delay Transmission of Markov Sources: Reinforcement Learning and Approximations

    … of the constructed state space and the lack of minorization or strong ergodicity results which are commonly assumed for average cost optimal stochastic control. These challenges invite rigorous reinforcement learning methods, which entail several open questions addressed in our paper. We present …

    queens Repository record for Optimal Zero-Delay Transmission of Markov Sources: Reinforcement Learning and Approximations (opens in a new tab)

  12. Bernstein polynomial processes for continuous time change detection, and spatially orthogonal factor models for spatial transcriptomics and remote sensing data

    … To address scalability, we develop a minorization-maximization-within-EM (MM-EM) algorithm yielding a computational complexity that is linear in the number of spatial locations. Finally, we provide a methodology for estimating the prior covariance $\Sigma$ under nonstationarity. For …

    bu Repository record for Bernstein polynomial processes for continuous time change detection, and spatially orthogonal factor models for spatial transcriptomics and remote sensing data (opens in a new tab)

  13. Efficient inference algorithms for network activities

    … Maximum Likelihood Estimator which utilizes the Minorization-Maximization framework. We verify the model against real life online advertisement logs in comparison with recent conversion rate estimation methods. To facilitate reproducible research, we also developed an open-source software package …

    gatech Repository record for Efficient inference algorithms for network activities (opens in a new tab)

  14. Advances and New Opportunities in MIMO Radar - Theoretical Analysis and Algorithms

    … receive STAP filter is proposed by means of the minorization-maximization technique. Two cases of known Doppler information and Doppler uncertainty on clutter bins are considered. The proposed algorithms demonstrate good performance with fast convergence speed and low complexity.

    aalto Repository record for Advances and New Opportunities in MIMO Radar - Theoretical Analysis and Algorithms (opens in a new tab)

  15. Submodular Optimization and Data Processing

    … (including greedy, majorization-minimization, minorization-maximization, and relaxation algorithms) that not only scale to large datasets but that also achieve theoretical approximation guarantees comparable to the state-of-the-art. We show that submodular partitioning subsumes a number of …

    washington Repository record for Submodular Optimization and Data Processing (opens in a new tab)

  16. Improved Estimation of Flexible Logit Models and an Extension to a Model with a t-distributed Error Kernel

    … In Chapter 2, we derive, implement, and test minorization-maximization (MM) algorithms to estimate the semiparametric LML and mixture-of-normals multinomial logit (MON-MNL) models. In a Monte Carlo study and empirical application to estimate consumer's willingness to adopt electric motorcycles …

    cornell Repository record for Improved Estimation of Flexible Logit Models and an Extension to a Model with a t-distributed Error Kernel (opens in a new tab)

  17. Transitions in new technology and market structure: applications and new methods for discrete choice model estimation

    … model. We develop a new method based on the Minorization-Maximization (MM) algorithm to address the prohibitive computational challenge of estimating over one million fixed effects in such a nonlinear model. Results show that over a short horizon (within a quarter), the probability of using …

    bu Repository record for Transitions in new technology and market structure: applications and new methods for discrete choice model estimation (opens in a new tab)

  18. Some Improved Markov Chain Convergence Rates

    Explicit convergence rates to equilibrium are established for non reversible Markov chains not having an atom via coupling methods. We consider two Markov chains having the same transition function but different initial conditions on the same probability space, that is, a coupling. A random time is …

    clemson Repository record for Some Improved Markov Chain Convergence Rates (opens in a new tab)

  19. Uncertainty Assessment and Convergence Analysis for Markov Chain Monte Carlo Algorithms

    This dissertation focuses on two fundamental areas in Markov chain Monte Carlo (MCMC) research: uncertainty assessment and asymptotic properties for Monte Carlo estimators, and convergence analysis of MCMC algorithms. We establish a multivariate strong invariance principle (SIP) and give …

    umn Repository record for Uncertainty Assessment and Convergence Analysis for Markov Chain Monte Carlo Algorithms (opens in a new tab)

  20. Robust approaches and optimization for 3D data

    We introduce a robust, purely geometric, representation framework for fundamental association and analysis problems involving multiple views and scenes. The framework utilizes surface patches / segments as the underlying data unit, and is capable of effectively harnessing macro scale 3D geometry in …

    gatech Repository record for Robust approaches and optimization for 3D data (opens in a new tab)