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 18 of 18 for “"Rate-guarantees"”.

  1. Distributed Policing with Full Utilization and Rate Guarantees

    … typically sells service at a fixed traffic rate to customers. This rate is enforced by allowing or dropping packets that pass through, in a process called policing. Distributed policing is a version of the problem where a number of policers must limit their combined traffic allowance to the …

    waterloo Repository record for Distributed Policing with Full Utilization and Rate Guarantees (opens in a new tab)

  2. Computational and Statistical Properties of Optimal Transport-Based Distances

    … GW distances lack comprehensive convergence rate guarantees. To address this gap, the final contribution of this thesis is to introduce the first algorithms for computing regularized GW distances subject to formal non-asymptotic convergence rate guarantees.

    cornell Repository record for Computational and Statistical Properties of Optimal Transport-Based Distances (opens in a new tab)

  3. Controller Synthesis through Riemannian Optimization

    … of this space and provide convergence rate guarantees for the resulting algorithms. For open-loop control, we develop an intrinsic successive convexification framework that optimizes trajectories directly on the manifold of states and inputs, leading to improved numerical behavior in …

    washington Repository record for Controller Synthesis through Riemannian Optimization (opens in a new tab)

  4. AUDITING LARGE LANGUAGE MODELS: ACCOUNTABILITY, INTEGRITY, AND COPYRIGHT

    … extraction accuracy and time efficiency for generated text. Second, to ensure inference integrity, we propose an efficient Zero-Knowledge Proof (ZKP) protocol optimized for architectures like GPT-2. By utilizing constraint fusion and circuit squeeze, we significantly reduce computational …

    nus Repository record for AUDITING LARGE LANGUAGE MODELS: ACCOUNTABILITY, INTEGRITY, AND COPYRIGHT (opens in a new tab) Download file for AUDITING LARGE LANGUAGE MODELS: ACCOUNTABILITY, INTEGRITY, AND COPYRIGHT (opens in a new tab)

  5. STATISTICAL METHODS FOR POLICY EVALUATION AND POLICY LEARNING

    … adjusts utility, providing regret and harm-rate guarantees. Simulations and HIV application show harm reduction while preserving performance, offering a path for safe learning in interconnected, sequential systems.

    nus Repository record for STATISTICAL METHODS FOR POLICY EVALUATION AND POLICY LEARNING (opens in a new tab) Download file for STATISTICAL METHODS FOR POLICY EVALUATION AND POLICY LEARNING (opens in a new tab)

  6. Enhancing optimization algorithms for non-convex settings : federated and decentralized learning

    … optimization. This thesis focuses on federated and decentralized learning within the framework of non-convex optimization, aiming to deepen the understanding of the field and derive novel results. Specifically, the first part of this work addresses two major challenges encountered in the …

    texas Repository record for Enhancing optimization algorithms for non-convex settings : federated and decentralized learning (opens in a new tab)

  7. Alternating Optimization: Constrained Problems, Adversarial Networks, and Robust Models

    … ADMM and consensus ADMM), and prove convergence rate guarantees that are widely applicable to variants of ADMM with changing parameters. We release the fast implementation for more than ten applications and validate the efficiency with several benchmark datasets for each application. Second, we …

    maryland Repository record for Alternating Optimization: Constrained Problems, Adversarial Networks, and Robust Models (opens in a new tab)

  8. Absolute quality-of-service differentiation in optical burst switching networks

    … networks. This thesis aims at providing loss rate guarantees for the priority-guaranteed (PG) classes on an end-to-end (E2E) basis while keeping the loss rate of the best effort (BE) class traffic as low as possible. We first present a per-hop absolute QoS differentiation scheme called …

    ottawa-retro Repository record for Absolute quality-of-service differentiation in optical burst switching networks (opens in a new tab)

  9. Statistical Theory for Neural Network-Based Learning

    … give a short introduction to concepts from rate distortion theory used in Chapter 4, and define the Barron approximation space used in Chapter 5. Furthermore, we conclude with a discussion of the relationship between regression and classification and related results from the literature. In …

    gatech Repository record for Statistical Theory for Neural Network-Based Learning (opens in a new tab)

  10. Opportunistic scheduling and resource allocation among heterogeneous users in wireless networks

    … of measurement-based opportunistic scheduling strategies in practical scenarios where users’ heterogenous capacity distributions are unknown. We make the case for using maximum quantile scheduling, i.e., scheduling a user whose current rate is in the highest quantile relative to its current …

    texas Repository record for Opportunistic scheduling and resource allocation among heterogeneous users in wireless networks (opens in a new tab)

  11. Dynamic Channel -Aware Bandwidth Management in IEEE 802.11 Networks

    … is to provide the application minimum throughput guarantees. In this work, we present a cross-layer architecture that enables the provision of rate guarantees to multimedia applications, while still catering to best-effort traffic. We perform centralized arbitration of the shared bandwidth …

    uiuc Repository record for Dynamic Channel -Aware Bandwidth Management in IEEE 802.11 Networks (opens in a new tab)

  12. Learning optimal and sample-efficient decision policies with guarantees

    … in high-stakes applications that may require guarantees. Traditional reinforcement learning algorithms rely on online interactions with the environment to gather data for policy learning and are often data-inefficient. This is problematic in scenarios where online interactions are costly, …

    oxford Repository record for Learning optimal and sample-efficient decision policies with guarantees (opens in a new tab)

  13. Efficient Algorithms for Bilevel Optimization Problems with Application in Machine Learning

    … nonlinear constraints. By introducing an accelerated primal-dual algorithm that achieves an optimal $\mathcal{O}(1/K)$ convergence rate for suboptimality, infeasibility, and consensus violation, we demonstrate a robust and efficient scheme for distributed optimization problems under limited or …

    arizona-thes Repository record for Efficient Algorithms for Bilevel Optimization Problems with Application in Machine Learning (opens in a new tab)

  14. On Packet Switch Scheduling in High-Speed Data Networks

    … core nodes to provide quality-of-service (QoS) guarantees for multimedia services, and to provide high switching capacity that makes use of the virtually unlimited bandwidth of optical fibers. The Internet's Success depends on the deployment of high-speed switches and routers that meet these two …

    mcmaster Repository record for On Packet Switch Scheduling in High-Speed Data Networks (opens in a new tab)

  15. Design and performance of resource allocation mechanisms for network slicing

    … exponential increase in demand for capacity generated by a collection of tenants and/or services with heterogeneous requirements. Multi-tenant network sharing, enabled through virtualization and network slicing, offers the opportunity to reduce operational and deployment costs, and the challenge …

    texas Repository record for Design and performance of resource allocation mechanisms for network slicing (opens in a new tab)

  16. Coping Uncertainty in Wireless Network Optimization

    … are either given a prior or can be accurately estimated. However, in many practical scenarios, some parameters are uncertain at the time of allocating resources and can only be modeled by random variables. Further, we only have limited knowledge of those uncertain parameters. For …

    vt Repository record for Coping Uncertainty in Wireless Network Optimization (opens in a new tab)

  17. Αλγόριθμοι δρομολόγησης για ευέλικτα οπτικά δίκτυα

    … the transmission parameters of the paths (symbol rate, modulation format etc) so that their quality of transmission is always acceptable. Finally, we developed an ILP algorithm that enables spectrum sharing between different class connections. In case the quality of transmission of a high class …

    greece Repository record for Αλγόριθμοι δρομολόγησης για ευέλικτα οπτικά δίκτυα (opens in a new tab)