761 results on '"APPROXIMATION algorithms"'
Search Results
2. Robust Inverse Q -Learning for Continuous-Time Linear Systems in Adversarial Environments.
- Author
-
Lian, Bosen, Xue, Wenqian, Lewis, Frank L., and Chai, Tianyou
- Abstract
This article proposes robust inverse $Q$ -learning algorithms for a learner to mimic an expert’s states and control inputs in the imitation learning problem. These two agents have different adversarial disturbances. To do the imitation, the learner must reconstruct the unknown expert cost function. The learner only observes the expert’s control inputs and uses inverse $Q$ -learning algorithms to reconstruct the unknown expert cost function. The inverse $Q$ -learning algorithms are robust in that they are independent of the system model and allow for the different cost function parameters and disturbances between two agents. We first propose an offline inverse $Q$ -learning algorithm which consists of two iterative learning loops: 1) an inner $Q$ -learning iteration loop and 2) an outer iteration loop based on inverse optimal control. Then, based on this offline algorithm, we further develop an online inverse $Q$ -learning algorithm such that the learner mimics the expert behaviors online with the real-time observation of the expert control inputs. This online computational method has four functional approximators: a critic approximator, two actor approximators, and a state-reward neural network (NN). It simultaneously approximates the parameters of $Q$ -function and the learner state reward online. Convergence and stability proofs are rigorously studied to guarantee the algorithm performance. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
3. Request Reliability Augmentation With Service Function Chain Requirements in Mobile Edge Computing.
- Author
-
Liang, Weifa, Ma, Yu, Xu, Wenzheng, Xu, Zichuan, Jia, Xiaohua, and Zhou, Wanlei
- Subjects
MOBILE computing ,EDGE computing ,COMPUTER network reliability ,NP-hard problems ,APPROXIMATION algorithms - Abstract
Provisioning reliable network services for mobile users in edge computing environments is the top priority of network service providers, as unreliable services will result in tremendous losses of revenues and customers. In this paper, we study a novel service reliability augmentation problem in a mobile edge computing (MEC) network, where mobile users request network services with service function chain (SFC) and reliability expectation requirements. To enhance the service reliability of user requests, it is a common practice to make use of redundant virtualized network function (VNF) instance placement in case the primary VNF instance fails. We aim to augment the service reliability of each admitted request to its specified reliability expectation, subject to computing capacity on each cloudlet. To this end, we first formulate a novel service reliability augmentation problem for each request with an SFC and a reliability expectation requirement, by augmenting its reliability through redundant VNF instance deployment. We then show that the problem is NP-hard, and provide an admission framework of user requests by placing primary VNF instances of network functions in the SFC to different cloudlets. We then deal with the service reliability augmentation problem of an admitted request under the assumption that all secondary VNF instances of each primary VNF instance must be placed into the cloudlets no more than $l$ l hops from the cloudlet of its primary VNF instance for a fixed $l$ l with $1\leq l \leq n-1$ 1 ≤ l ≤ n - 1 , where $n$ n is the number of cloudlets in the network, for which we formulate an integer linear program solution, and develop a randomized algorithm with a good approximation ratio and high probability, at the expense of moderate resource constraint violations. We also devise a deterministic heuristic for the problem without any resource violation. We third study the service reliability augmentation problem for a set of admitted requests by extending the proposed algorithm for the service reliability augmentation problem for a single request admission. We finally evaluate the performance of the proposed algorithms through experimental simulations. Experimental results demonstrate that the proposed algorithms are promising, and their empirical results are superior to their analytical counterparts. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
4. Multi-Scale Exposure Fusion via Content Adaptive Edge-Preserving Smoothing Pyramids.
- Author
-
Jia, Weibin, Song, Zhihuan, and Li, Zhengguo
- Subjects
- *
HIGH dynamic range imaging , *PYRAMIDS , *IMAGE color analysis , *SMOOTHING (Numerical analysis) - Abstract
Multi-scale exposure fusion (MEF) is an efficient way to fuse differently exposed low dynamic range (LDR) images of a high dynamic range (HDR) scene into an information enriched LDR image. In this paper, a new MEF algorithm is proposed to merge the differently exposed LDR images by introducing novel content adaptive edge-preserving smoothing (CAS) pyramids for the weight maps of all the LDR images. With the proposed CAS pyramids, details in the brightest and darkest regions of the HDR scene are preserved better than existing MEF algorithms on top of the Gaussian pyramids and edge-preserving smoothing pyramids. Comparisons experimentally demonstrate the effectiveness of the proposed algorithm to nine state-of-the-art MEF algorithms from both subjective and objective points of view regardless the image sizes. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
5. Universality of Linearized Message Passing for Phase Retrieval With Structured Sensing Matrices.
- Author
-
Dudeja, Rishabh and Bakhshizadeh, Milad
- Subjects
- *
MESSAGE passing (Computer science) , *MATRICES (Mathematics) , *DISCRETE Fourier transforms , *COLUMNS - Abstract
In the phase retrieval problem one seeks to recover an unknown $n$ dimensional signal vector $\mathbf {x}$ from $m$ measurements of the form $y_{i} = |(\mathbf {A} \mathbf {x})_{i}|$ , where $\mathbf {A}$ denotes the sensing matrix. Many algorithms for this problem are based on approximate message passing. For these algorithms, it is known that if the sensing matrix $\mathbf {A}$ is generated by sub-sampling $n$ columns of a uniformly random (i.e., Haar distributed) orthogonal matrix, in the high dimensional asymptotic regime ($m,n \rightarrow \infty, n/m \rightarrow \kappa $), the dynamics of the algorithm are given by a deterministic recursion known as the state evolution. For a special class of linearized message-passing algorithms, we show that the state evolution is universal: it continues to hold even when $\mathbf {A}$ is generated by randomly sub-sampling columns of the Hadamard-Walsh matrix, if the signal is drawn from a Gaussian prior. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
6. Dual Dynamic Programming for the Mean Standard Deviation Canadian Traveller Problem.
- Author
-
Guo, Hongliang, Shi, Rui, Rus, Daniela, and Yau, Wei-Yun
- Subjects
- *
DYNAMIC programming , *TRAVEL time (Traffic engineering) , *TRAVELERS , *HEURISTIC algorithms , *APPROXIMATION algorithms , *STANDARD deviations - Abstract
This article studies the mean standard deviation (mean-std) Canadian traveller problem (CTP). Different from the canonical CTP, which aims at minimizing the traveller's expected travel time, while considering edge breakdown probabilities, we introduce the reliability version of CTP, which tries to find a routing policy with the minimal linear combination of the travel time's mean and standard deviation. With the recent development of internet-of-things (IoT) technology, the transportation network's edges' travel-time statistics, i.e., mean and standard deviation, as well as the traversal probabilities, are available to the end users. With those information, we propose a dual dynamic programming (DDP) method, which simultaneously estimates the first-order and the second-order moments of a given decision-list (DL) policy, and thereby makes improvements towards to the optimal one through the generalized policy iteration (GPI) scheme. We construct an open source benchmark environment to evaluate the performance of different mean-std CTP solutions, and show that the DDP method outperforms state of the arts in a range of transportation networks. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
7. Answering Why-Questions for Subgraph Queries.
- Author
-
Song, Qi, Namaki, Mohammad Hossein, Lin, Peng, and Wu, Yinghui
- Subjects
- *
KNOWLEDGE graphs , *SOCIAL networks , *HEURISTIC algorithms , *APPROXIMATION algorithms , *ALGORITHMS - Abstract
Subgraph queries are routinely used to search for entities in richly attributed graphs e.g., social networks and knowledge graphs. With little knowledge of underlying data, users often need to rewrite queries multiple times to reach desirable answers. Why-questions are studied to clarify missing or unexpected query results. This paper makes a first step to answer Why-questions for entity search in attributed graphs. We consider three common types of Why-questions: Why-not, Why, and Why-rank, which suggest query manipulations that are responsible for user-specified missing, unexpected, and undesirably ranked entities, respectively. (1) We approach a general query rewriting paradigm that suggests to identify desired entities that are specified by Why-questions. We introduce measures that characterize good query rewrites by incorporating both query editing cost and answer closeness. (2) While computing optimal query rewrites is intractable, we develop feasible algorithms, from approximation to fast heuristics, and provide query rewrites with (near) optimality guarantees whenever possible, for Why, Why-not and Why-rank questions. We further show that our results remain intact for Why questions that (1) request a single query rewrite to clarify multiple types of entities, and (2) variants such as Why-empty and Why-so-many, by providing the matching algorithms. Using real-world graphs, we experimentally verify that our algorithms are effective and feasible for large graphs. Our case study also verifies their application in e.g., knowledge exploration. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
8. A Sequential Algorithm for Jerk Limited Speed Planning.
- Author
-
Consolini, Luca, Locatelli, Marco, and Minari, Andrea
- Subjects
- *
LINEAR velocity , *LINEAR acceleration , *NONLINEAR programming , *ALGORITHMS , *CONVEX functions - Abstract
In this article, we discuss a sequential algorithm for the computation of a minimum-time speed profile over a given path, under velocity, acceleration, and jerk constraints. Such a problem arises in industrial contexts, such as automated warehouses, where LGVs need to perform assigned tasks as fast as possible in order to increase productivity. It can be reformulated as an optimization problem with a convex objective function, linear velocity and acceleration constraints, and nonconvex jerk constraints, which, thus, represent the main source of the difficulty. While existing nonlinear programming (NLP) solvers can be employed for the solution of this problem, it turns out that the performance and robustness of such solvers can be enhanced by the sequential line-search algorithm proposed in this article. At each iteration, a feasible direction, with respect to the current feasible solution, is computed, and a step along such direction is taken in order to compute the next iterate. The computation of the feasible direction is based on the solution of a linearized version of the problem, and the solution of the linearized problem, through an approach that strongly exploits its special structure, represents the main contribution of this work. The efficiency of the proposed approach with respect to existing NLP solvers is proven through different computational experiments. Note to Practitioners—This article was motivated by the needs of LGV manufacturers. In particular, it presents an algorithm for computing the minimum-time speed law for an LGV along a preassigned path, respecting assigned velocity, acceleration, and jerk constraints. The solution algorithm should be: 1) fast, since speed planning is made continuously throughout the workday, not only when an LGV receives a new task but also during the execution of the task itself, since conditions may change, e.g., if the LGV has to be halted for security reasons and 2) reliable, i.e., it should return solutions of high quality, because a better speed profile allows to save time and even small percentage improvements, say a 5% improvement, has a considerable impact on the productivity of the warehouse, and, thus, determines a significant economic gain. The algorithm that we propose meets these two requirements, and we believe that it can be a useful tool for LGV manufacturers and users. It is obvious that the proposed method also applies to the speed planning problem for vehicles other than LGVs, e.g., road vehicles. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
9. Charging Path Optimization in Mobile Networks.
- Author
-
Chen, Lin, Lin, Shan, Huang, Hua, and Yang, Weihua
- Subjects
TIME management ,ELECTRIC charge ,APPROXIMATION algorithms ,TIME perspective ,HEURISTIC algorithms ,DRONE aircraft delivery - Abstract
We study a class of generic charging path optimization problems arising from emerging networking applications, where mobile chargers are dispatched to deliver energy to mobile agents (e.g., robots, drones, vehicles), which have specified tasks and mobility patterns. We instantiate our work by focusing on finding the charging path maximizing the number of nodes charged within a fixed time horizon. We show that this problem is APX-hard. By recursively decomposing the problem into sub-problems of searching sub-paths, we design quasi-polynomial-time algorithms achieving logarithmic approximation to the optimum charging path. Our approximation algorithms can be further adapted and extended to solve a variety of charging path optimization and scheduling problems with realistic constraints, such as limited time and energy budget. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
10. Static Output Feedback Control for T–S Fuzzy Systems via a Successive Convex Optimization Algorithm.
- Author
-
Ren, Yingying, Ding, Da-Wei, Li, Qing, and Xie, Xiangpeng
- Subjects
FUZZY control systems ,MATHEMATICAL optimization ,FUZZY logic ,HEURISTIC algorithms ,FUZZY systems ,STATE feedback (Feedback control systems) ,PSYCHOLOGICAL feedback - Abstract
This article focuses on developing a static output feedback (SOF) control scheme for Takagi–Sugeno fuzzy systems. The proposed SOF controller does not share the same premise membership functions with the model, which permits enhancing the flexibility in controller design and implementation. By contrast with the state feedback case, the SOF control generally results in nonconvex design conditions. To circumvent this problem, we develop a successive convex optimization algorithm, which is based on solving a sequence of more tractable convex optimization problems obtained by approximating the nonconvex constraints with some convex ones. As a heuristic algorithm, the validity of the developed successive convex optimization algorithm is highly affected by initial conditions, and, recognizing this, we put forward an iterative procedure for determining the feasible initial condition. Finally, two illustrative examples are presented to validate the efficiency of the proposed algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
11. Profit Driven Service Provisioning in Edge Computing via Deep Reinforcement Learning.
- Author
-
Li, Yuchen, Liang, Weifa, and Li, Jing
- Abstract
With the integration of Mobile Edge Computing (MEC) and Network Function Virtualization (NFV), service providers are able to provide low-latency services to mobile users for profit. In this paper, we study the online service placement and request assignment problem in an MEC network, where service requests arrive one by one without the knowledge of future arrivals, and each arrived request demands a specific service with a tolerable service delay requirement with the aim to maximize the profit of the service provider, through admitting as many service requests as possible for a given monitoring period. This optimization objective is achieved by assigning service requests to appropriate cloudlets in the MEC network, pre-installing service instances into cloudlets to shorten service delays, and accommodating new services by revoking some idle service instances from cloudlets due to limited computing resources in MEC networks. In this paper, we first show that the problem is NP-hard. We then devise an efficient deep reinforcement learning algorithm for the online service placement and request assignment problem that consists of a deep reinforcement learning-based prediction mechanism for dynamic service placement, followed by a dynamic request assignment procedure to assign requests to cloudlets. We finally evaluate the performance of the proposed algorithms by conducting experiments through simulations. Simulation results demonstrate that the proposed algorithm is promising, improving performance by 46.8% compared with that of the comparison algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
12. A Semidistributed Interior Point Algorithm for Optimal Coordination of Automated Vehicles at Intersections.
- Author
-
Hult, Robert, Zanon, Mario, Gros, Sebastien, and Falcone, Paolo
- Subjects
INTERIOR-point methods ,AUTONOMOUS vehicles ,ALGORITHMS ,DISTRIBUTED algorithms ,LINEAR algebra ,DATA reduction ,AUTOMOBILE interiors - Abstract
In this article, we consider the optimal coordination of automated vehicles at intersections under fixed crossing orders. We formulate the problem using direct optimal control and exploit the structure to construct a semidistributed primal-dual interior-point algorithm to solve it by parallelizing most of the computations. Differently from standard distributed optimization algorithms, where the optimization problem is split, in our approach we split the linear algebra steps, such that the algorithm takes the same steps as a fully centralized one, while still performing computations in a distributed fashion. We analyze the communication requirements of the algorithm, and propose an approximation scheme which can significantly reduce the data exchange. We demonstrate the effectiveness of the algorithm in hard but realistic scenarios, which show that the approximation leads to reductions in communicated data of almost 99% of the exact formulation, at the expense of less than 1% suboptimality. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
13. Macroscopic Analysis of Vector Approximate Message Passing in a Model-Mismatched Setting.
- Author
-
Takahashi, Takashi and Kabashima, Yoshiyuki
- Subjects
- *
MESSAGE passing (Computer science) , *VECTOR analysis , *INFERENTIAL statistics , *RANDOM matrices , *STATISTICAL mechanics , *RANDOM graphs - Abstract
In this study, macroscopic properties of the vector approximate message passing (VAMP) algorithm for inference of generalized linear models are investigated using a non-rigorous heuristic method of statistical mechanics when the true posterior cannot be used and the measurement matrix is a sample from rotation-invariant random matrix ensembles. The focus is on the correspondence between the non-rigorous replica analysis of statistical mechanics and the performance assessment of VAMP in the model-mismatched setting. The correspondence of this kind is well-known when the measurement matrix has independent and identically distributed entries. However, when the measurement matrix follows a general rotation-invariant matrix ensemble, the correspondence has been validated only under limited cases, such as the Bayes optimal inference or the convex empirical risk minimization. The result presented in this paper is to extend the scope of such correspondence. Herein, we heuristically derive the explicit formula of state-evolution equations, which macroscopically describe VAMP dynamics for the current model-mismatched case, and show that their fixed point is generally consistent with the replica symmetric solution obtained by the replica method of statistical mechanics. We also show that the fixed point of VAMP can exhibit a microscopic instability, which indicates that message variables continue to move by VAMP while their macroscopically summarized quantities converge to fixed values. The critical condition the for microscopic instability agrees with that for breaking the replica symmetry that is derived within the non-rigorous replica analysis. The results of the numerical experiments cross-check our findings. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
14. Broad Learning System Approximation-Based Adaptive Optimal Control for Unknown Discrete-Time Nonlinear Systems.
- Author
-
Yuan, Liang'En, Li, Tieshan, Tong, Shaocheng, Xiao, Yang, and Shan, Qihe
- Subjects
- *
NONLINEAR systems , *DISCRETE-time systems , *INSTRUCTIONAL systems , *DYNAMIC programming , *SYSTEM dynamics , *ADAPTIVE control systems , *MULTICOLLINEARITY - Abstract
This article investigates optimal control problem for a class of discrete-time (DT) nonlinear systems with unknown dynamics. With the help of a broad learning system (BLS), a novel online adaptive dynamic programming (ADP) controller is presented. First, to approximate the unknown system dynamics, an approximator based on BLS is presented. The connection weights are calculated by the data of the system by using the ridge regression algorithm. Then, two BLSs are adopted to approximate the optimal cost function and optimal control law, respectively. The connection weights of these two BLSs are updated using the given weights tuning law at each sampling instant. The proposed optimal controller is proved to ensure that all the system states and estimation errors are uniform ultimate bounded. Finally, simulation examples are carried out to further demonstrate the effectiveness of the proposed BLS-based approximator and optimal controller. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
15. Decentralized Randomized Block-Coordinate Frank–Wolfe Algorithms for Submodular Maximization Over Networks.
- Author
-
Zhang, Mingchuan, Zhou, Yangfan, Ge, Quanbo, Zheng, Ruijuan, and Wu, Qingtao
- Subjects
- *
CONSTRAINED optimization , *ALGORITHMS , *GREEDY algorithms , *APPROXIMATION algorithms , *LINEAR programming , *COORDINATES - Abstract
We consider decentralized large-scale continuous submodular constrained optimization problems over networks, where the goal is to maximize a sum of nonconvex functions with diminishing returns property. However, the computations of the projection step and the whole gradient can become prohibitive in high-dimensional constrained optimization problems. For this reason, a decentralized randomized block-coordinate Frank-Wolfe algorithm is proposed for submoduar maximization over networks by local communication and computation, which adopts the randomized block-coordinate descent and the Frank-Wolfe technique. We also show that the proposed algorithm converges to an approximation fact $(1-e^{-p_{\max }/p_{\min }})$ of the global maximal points at a rate of $\mathcal {O}(1/T)$ by choosing a suitable stepsize, where $T$ is the number of iterations. In addition, we confirm the theoretical results by experiments. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
16. Joint Wireless and Edge Computing Resource Management With Dynamic Network Slice Selection.
- Author
-
Josilo, Sladana and Dan, Gyorgy
- Subjects
EDGE computing ,RESOURCE management ,RADIO resource management ,APPROXIMATION algorithms ,5G networks ,NP-hard problems ,COMPUTER systems ,ASSIGNMENT problems (Programming) - Abstract
Network slicing is a promising approach for enabling low latency computation offloading in edge computing systems. In this paper, we consider an edge computing system under network slicing in which the wireless devices generate latency sensitive computational tasks. We address the problem of joint dynamic assignment of computational tasks to slices, management of radio resources across slices and management of radio and computing resources within slices. We formulate the Joint Slice Selection and Edge Resource Management (JSS-ERM) problem as a mixed-integer problem with the objective to minimize the completion time of computational tasks. We show that the JSS-ERM problem is NP-hard and develop an approximation algorithm with bounded approximation ratio based on a game theoretic treatment of the problem. We use extensive simulations to provide insight into the performance of the proposed solution from the perspective of the whole system and from the perspective of individual slices. Our results show that the proposed slicing policy can achieve significant gains compared to the equal slicing policy, and that the computational complexity of the proposed task placement algorithm is approximately linear in the number of devices. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
17. Reducing the Service Function Chain Backup Cost Over the Edge and Cloud by a Self-Adapting Scheme.
- Author
-
Shang, Xiaojun, Huang, Yaodong, Liu, Zhenhua, and Yang, Yuanyuan
- Subjects
VIRTUAL networks ,MOBILE computing ,HEURISTIC algorithms ,APPROXIMATION algorithms ,COST - Abstract
Emerging virtual network functions (VNFs) bring new opportunities to network services on the edge within customers’ premises. Network services are realized by chained up VNFs, which are called service function chains (SFCs). These services are deployed on commercial edge servers for higher flexibility and scalability. Despite such promises, it is still unclear how to provide highly available and cost-effective SFCs under edge resource limitations and time-varying VNF failures. In this paper, we propose a novel Reliability-aware Adaptive Deployment scheme named RAD to efficiently place and back up SFCs over both the edge and the cloud. Specifically, RAD first deploys SFCs to fully utilize edge resources. It then uses both static backups and dynamic ones created on the fly to guarantee the availability under the resource limitation of edge networks. RAD does not assume failure rates of VNFs but instead strives to find the sweet spot between the desired availability of SFCs and the backup cost. Theoretical performance bounds, extensive simulations, and small-scale experiments highlight that RAD provides significantly higher availability with lower backup costs compared with existing baselines. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
18. 5G Private Network Deployment Optimization Based on RWSSA in Open-Pit Mine.
- Author
-
Chang, Zhaozhao, Gu, Qinghua, Lu, Caiwu, Zhang, Yanhong, Ruan, Shunling, and Jiang, Song
- Abstract
5G communication network is vital to the intelligent and unmanned technology of open-pit mine, but the high cost of 5G base station deployment will bring huge cost increases to mining enterprises. Thus, this article proposes an improved sparrow search algorithm (SSA) using random walk strategy (RWSSA) to optimization the distribution and signal coverage of 5G base stations in open-pit mine. In order to verify the performance of the algorithm, the SSA, the modified ant lion optimizer, the particle swarm optimization, and the RWSSA were used to compare and analyze the accuracy and speed of the algorithm in solving high dimensionality benchmark functions, respectively. The dimensions used in the test are 30, 100, and 500 dimensions. After that, four algorithms were applied to a real example to optimize the deployment of 5G base stations, including macrobase stations and microbase stations. RWSSA has very good performance in terms of performance and practical application. Therefore, RWSSA is more suitable for the application of 5G base station distribution optimization in open-pit mines. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
19. Fully Dynamic $k$ k -Center Clustering With Improved Memory Efficiency.
- Author
-
Chan, T.-H. Hubert, Guerquin, Arnaud, Hu, Shuguang, and Sozio, Mauro
- Subjects
- *
DATA mining , *APPROXIMATION algorithms , *MACHINE learning , *MEMORY , *HEURISTIC algorithms , *ALGORITHMS - Abstract
Static and dynamic clustering algorithms are a fundamental tool in any machine learning library. Most of the efforts in developing dynamic machine learning and data mining algorithms have been focusing on the sliding window model or more simplistic models. However, in many real-world applications one might need to deal with arbitrary deletions and insertions. For example, one might need to remove data items that are not necessarily the oldest ones, because they have been flagged as containing inappropriate content or due to privacy concerns. Clustering trajectory data might also require to deal with more general update operations. We develop a $(2+\epsilon)$ (2 + ε) -approximation algorithm for the $k$ k -center clustering problem with “small” amortized cost under the fully dynamic adversarial model. In such a model, points can be added or removed arbitrarily, provided that the adversary does not have access to the random choices of our algorithm. The amortized cost of our algorithm is poly-logarithmic when the ratio between the maximum and minimum distance between any two points in input is bounded by a polynomial, while $k$ k and $\epsilon$ ε are constant. Furthermore, we significantly improve the memory requirement of our fully dynamic algorithm, although at the cost of a worse approximation ratio of $4 +\epsilon$ 4 + ε . Our theoretical results are complemented with an extensive experimental evaluation on dynamic data from Twitter, Flickr, as well as trajectory data, demonstrating the effectiveness of our approach. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
20. Compressed Sensing With Upscaled Vector Approximate Message Passing.
- Author
-
Skuratovs, Nikolajs and Davies, Michael E.
- Subjects
- *
MESSAGE passing (Computer science) , *COMPRESSED sensing , *INVERSE problems , *IMAGE reconstruction , *LINEAR operators , *ALGORITHMS - Abstract
The Recently proposed Vector Approximate Message Passing (VAMP) algorithm demonstrates a great reconstruction potential at solving compressed sensing related linear inverse problems. VAMP provides high per-iteration improvement, can utilize powerful denoisers like BM3D, has rigorously defined dynamics and is able to recover signals measured by highly undersampled and ill-conditioned linear operators. Yet, its applicability is limited to relatively small problem sizes due to the necessity to compute the expensive LMMSE estimator at each iteration. In this work we consider the problem of upscaling VAMP by utilizing Conjugate Gradient (CG) to approximate the intractable LMMSE estimator. We propose a rigorous method for correcting and tuning CG withing CG-VAMP to achieve a stable and efficient reconstruction. To further improve the performance of CG-VAMP, we design a warm-starting scheme for CG and develop theoretical models for the Onsager correction and the State Evolution of Warm-Started CG-VAMP (WS-CG-VAMP). Additionally, we develop robust and accurate methods for implementing the WS-CG-VAMP algorithm. The numerical experiments on large-scale image reconstruction problems demonstrate that WS-CG-VAMP requires much fewer CG iterations compared to CG-VAMP to achieve the same or superior level of reconstruction. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
21. Resilient Scheduling of Moldable Parallel Jobs to Cope With Silent Errors.
- Author
-
Benoit, Anne, Le Fevre, Valentin, Perotin, Lucas, Raghavan, Padma, Robert, Yves, and Sun, Hongyang
- Abstract
We study the resilient scheduling of moldable parallel jobs on high-performance computing (HPC) platforms. Moldable jobs allow for choosing a processor allocation before execution, and their execution time obeys various speedup models. The objective is to minimize the overall completion time or the makespan, when jobs can fail due to silent errors and hence may need to be re-executed after each failure until successful completion. Our work generalizes the classical scheduling framework for failure-free jobs. To cope with silent errors, we introduce two resilient scheduling algorithms, Lpa-List and Batch-List, both of which use the List strategy to schedule the jobs. Without knowing a priori how many times each job will fail, Lpa-List relies on a local strategy to allocate processors to the jobs, while Batch-List schedules the jobs in batches and allows only a restricted number of failures per job in each batch. We prove approximation ratios for the two algorithms under several prominent speedup models (e.g., roofline, communication, Amdahl, power, monotonic, and a mix model). An extensive set of simulations is conducted to evaluate different variants of the two algorithms, and the results show that they consistently outperform some baseline heuristics. Overall, our best algorithm is within a factor of 1.6 of a lower bound on average over the entire set of experiments, and within a factor of 4.2 in the worst case. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
22. An Asymmetric Alignment Algorithm for Estimating Ancestor-Descendant Edit Distance for Tandem Repeats.
- Author
-
Matroud, Atheer, Tuffley, Christopher, and Hendy, Michael
- Abstract
Tandem repeats are repetitive structures present in some DNA sequences, consisting of many repeated copies of a single motif. They can serve as important markers for phylogenetic and population genetic studies, due to the high polymorphism in the number of motif copies as well as variations in the motif. The first step in using tandem repeats for phylogenetic studies is to estimate the evolutionary distance between a pair $D_1$ D 1 and $D_2$ D 2 of tandem repeat sequences with homologous motifs. This problem can be broken into two sub-problems: 1) Construct the most recent common ancestor of the sequences. 2) Calculate the evolutionary distance between each sequence and the hypothesised common ancestor. We present an algorithm that estimates the solution to the second problem. This takes the form of an asymmetric alignment algorithm to estimate the evolutionary distance between two tandem repeat sequences $A$ A and $D$ D , where $D$ D is assumed to have descended from $A$ A , under a model that allows block duplication, deletion, and variant substitution. The algorithm is asymmetric in the sense that the two input sequences $A$ A and $D$ D play different roles in the calculations, reflecting the assumption that $D$ D descends from $A$ A . Our model assumes static motif boundaries, meaning that motif duplication and deletion events must respect the motif boundaries. The algorithm may also be applied without modification to more complex repetitive structures with two or more motifs, such as nested tandem repeats. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
23. An Analytical Method to Compute the Approximate Inverses of a Fuzzy Matrix With Max-Product Composition.
- Author
-
Wu, Yan-Kuen, Lur, Yung-Yih, Kuo, Hsun-Chih, and Wen, Ching-Feng
- Subjects
FUZZY relational equations ,MATRIX inversion ,APPROXIMATION algorithms ,HAMMING distance ,MATRIX converters ,HEURISTIC algorithms - Abstract
This article is concerned with the problem of computing the approximate preinverses of a fuzzy matrix with max-product composition. Employing the weighted $L_1$ distance, a variety of evaluation functions are defined according to the preselected weights, and then, an analytical method is proposed to determine all approximate preinverses of equal quality by minimizing the preselected evaluation function. Since only the approximate preinverses with fewer or preferably no zeros are acceptable for many practical applications, a criterion for selecting weights is established to ensure that the determined approximate preinverses are desirable. Some examples are given to illustrate our results. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
24. From Spectrum Bonding to Contiguous-Resource Batching Task Scheduling.
- Author
-
Shi, Hehuan and Chen, Lin
- Subjects
DYNAMIC spectrum access ,APPROXIMATION algorithms ,RESOURCE allocation ,SCHEDULING ,COMPUTER systems - Abstract
We formulate and analyze a generic task scheduling problem: a set of tasks need to be executed on a pool of continuous resource such as spectrum and memory, each requiring a certain amount of time and contiguous resource; some tasks can be executed simultaneously in batch by sharing the resource, while others requiring exclusive use of the resource. We seek an optimal resource allocation and the related scheduling policy maximizing the overall system utility. This problem, termed as the contiguous-resource batching task scheduling problem, arises in a variety of engineering fields, where communication and storage resources are potential bottlenecks and thus need to be carefully scheduled. Two motivating examples are the spectrum bonding problem in dynamic spectrum access systems and the dynamic storage allocation problem in computer systems. In this paper, we investigate both offline and online scheduling settings. We first establish the NP-hardness of the offline setting and the inapproximability of the online setting in its generic form. Given the theoretical performance limit, we then develop approximation algorithms with mathematically proven performance guarantee in terms of approximation and competitive ratios for the offline and online settings. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
25. HARS: A High-Available and Resource-Saving Service Function Chain Placement Approach in Data Center Networks.
- Author
-
Niu, Meng, Han, Qingmian, Cheng, Bo, Wang, Meng, Xu, Ziqi, Gu, Wenyuan, Zhang, Shuhao, and Chen, Junliang
- Abstract
Network function virtualization (NFV) is a promising technology that decouples network functions from hardware. Connecting virtual network functions (VNFs) in series to form a service function chain (SFC) can flexibly orchestrate and expand network functions. However, there are higher availability requirements for SFCs. This paper aims to solve the SFC placement problem under availability and resource constraints. This paper proposes the sideway cross (SC) backup model, which considers the availability of both VNFs and physical machines (PMs) in a data center. The SC model cross-arranges the backup instances of VNFs to guarantee availability and optimize resource consumption. Then, this paper proposes the heuristic meteor shower optimization (MSO) algorithm to place SFCs. Compared to traditional heuristic algorithms, MSO can improve the execution time by approximately 200%. Combined with the SC backup model, MSO can effectively improve the availability and resource overhead. The evaluation results show that the proposed approach can guarantee higher availability and consumes fewer resources. The proposed approach only needs 75% of the resources to achieve the same availability as the state-of-the-art models. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
26. Distributed Kalman Filtering Through Trace Proximity.
- Author
-
Liu, Wei, Shi, Peng, and Wang, Shuoyu
- Subjects
- *
LINEAR systems , *DISCRETE-time systems , *DISTRIBUTED algorithms , *DISCRETE time filters , *KALMAN filtering , *DESIGN techniques , *INFORMATION measurement - Abstract
This article is concerned with the distributed Kalman filtering problem for discrete-time linear systems whose measurement information comes from a set of sensor nodes that can communicate with their direct neighbors. Two algorithms for distributed Kalman filtering are proposed, where the first algorithm is based on single-node measurement and the second algorithm is based on neighboring-node measurements. In order to improve the performance, a novel criterion is introduced to the algorithm design, where in the criterion, the proximity of matrix’s trace is used to determine the proximity of positive semidefinite matrix. We prove that all the proposed algorithms for distributed Kalman filtering are unbiased. Numerical examples are provided to demonstrate the correctness of the proposed theoretical method and the performance of the proposed new design technique. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
27. A Convex Approach to Data-Driven Optimal Control via Perron–Frobenius and Koopman Operators.
- Author
-
Huang, Bowen and Vaidya, Umesh
- Subjects
- *
NONLINEAR systems , *SYSTEM dynamics , *DYNAMICAL systems , *STABILITY theory , *OPERATOR functions - Abstract
This article is about the data-driven computation of optimal control for a class of control affine deterministic nonlinear systems. We assume that the control dynamical system model is not available, and the only information about the system dynamics is available in the form of time-series data. We provide a convex formulation for the optimal control problem (OCP) of the nonlinear system. The convex formulation relies on the duality result in the dynamical system’s stability theory involving density function and Perron–Frobenius operator. We formulate the OCP as an infinite-dimensional convex optimization program. The finite-dimensional approximation of the optimization problem relies on the recent advances made in the Koopman operator’s data-driven computation, which is dual to the Perron–Frobenius operator. Simulation results are presented to demonstrate the application of the developed framework. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
28. Stream Processing of Shortest Path Query in Dynamic Road Networks.
- Author
-
Zhang, Mengxuan, Li, Lei, Hua, Wen, and Zhou, Xiaofang
- Subjects
- *
DECOMPOSITION method , *LOCATION-based services , *SCALABILITY , *HEURISTIC algorithms , *APPROXIMATION algorithms , *BATCH processing , *ALGORITHMS - Abstract
Shortest path query in road network is pervasive in various location-based services nowadays. As the business expands, the scalability issue becomes severer and more servers are deployed to cope with it. Moreover, as the traffic condition keeps changing over time, the existing index-based approaches can hardly adapt to the real-life dynamic environment. Therefore, batch shortest path algorithms have been proposed recently to answer a set of queries together using shareable computation. Besides, they can also work in a highly dynamic environment as no index is needed. However, the existing batch algorithms either assume the batch queries are finely decomposed or just process them without differentiation, resulting in poor query efficiency. In this work, we assume the traffic condition is stable over a short period and treat the issued queries within that period as a stream of query sets. Specifically, we first propose three query set decomposition methods to cluster one query set into multiple query subsets: Zigzag that considers the 1-N shared computation; Co-Clustering that considers the source and target's spatial locality; and Search-Space-Aware that further incorporates search space estimation. After that, we propose two batch algorithms that take advantage of the previously decomposed query sets for efficient query answering: R2R that finds a set of approximate shortest paths from one region to another with bounded error; and Local Cache that improves the existing Global Cache with higher cache hit ratio. Finally, we design three efficient stream processing methods for intra-batch shared computation. The experiments on a large real-world query sets verify the effectiveness and efficiency of our decomposition methods compared with the state-of-the-art batch algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
29. Access Management in Joint Sensing and Communication Systems: Efficiency Versus Fairness.
- Author
-
Nguyen, Trung Thanh, Elbassioni, Khaled, Luong, Nguyen Cong, Niyato, Dusit, and Kim, Dong In
- Subjects
- *
TELECOMMUNICATION systems , *POLYNOMIAL time algorithms , *APPROXIMATION algorithms , *HEURISTIC algorithms , *FAIRNESS - Abstract
In this paper, we consider a distributed joint sensing and communication (DJSC) system in which each radar sensor as a JSC node is equipped with a sensing function and a communication function. Deploying multiple JSC nodes may require a large amount of bandwidth. Therefore, we investigate the bandwidth allocation problem for the DJSC system. In particular, we aim to optimize the bandwidth allocation to the sensing function and the communication function of the JSC nodes. To improve the allocation efficiency while benefiting the spatial diversity advantage of the DJSC systems, the objective is to maximize the sum of sensing performances, i.e., estimation rates, communication performances, i.e., communication data rates, and fairness of all the users. The optimization problem is non-convex and difficult to be solved. For this, we propose a fully polynomial time approximation algorithm, and we prove that the approximation algorithm can guarantee a near-optimal solution with an accuracy bound of $\epsilon$. Furthermore, we propose to use a heuristic algorithm with lower complexity. The simulation results show that both the proposed algorithms are able to achieve the solutions close to the optimum in a computationally efficient fashion. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
30. Maximizing User Service Satisfaction for Delay-Sensitive IoT Applications in Edge Computing.
- Author
-
Li, Jing, Liang, Weifa, Xu, Wenzheng, Xu, Zichuan, Jia, Xiaohua, Zhou, Wanlei, and Zhao, Jin
- Subjects
- *
EDGE computing , *ONLINE algorithms , *INTERNET of things , *HEURISTIC algorithms , *APPROXIMATION algorithms - Abstract
The Internet of Things (IoT) technology provisions unprecedented opportunities to evolve the interconnection among human beings. However, the latency brought by unstable wireless networks and computation failures caused by limited resources on IoT devices prevents users from experiencing high efficiency and seamless user experience. To address these shortcomings, the integrated Mobile Edge Computing (MEC) with remote clouds is a promising platform to enable delay-sensitive service provisioning for IoT applications, where edge-clouds (cloudlets) are co-located with wireless access points in the proximity of IoT devices. Thus, computation-intensive and sensing data from IoT devices can be offloaded to the MEC network immediately for processing, and the service response latency can be significantly reduced. In this paper, we first formulate two novel optimization problems for delay-sensitive IoT applications, i.e., the total utility maximization problems under both static and dynamic offloading task request settings, with the aim to maximize the accumulative user satisfaction on the use of the services provided by the MEC, and show the NP-hardness of the defined problems. We then devise efficient approximation and online algorithms with provable performance guarantees for the problems in a special case where the bandwidth capacity constraint is negligible. We also develop efficient heuristic algorithms for the problems with the bandwidth capacity constraint. We finally evaluate the performance of the proposed algorithms through experimental simulations. Experimental results demonstrate that the proposed algorithms are promising in reducing service delays and enhancing user satisfaction, and the proposed algorithms outperform their counterparts by at least 10.8 percent. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
31. Mobility-Aware Offloading and Resource Allocation in NOMA-MEC Systems via DC.
- Author
-
Li, Changxiang, Wang, Hong, and Song, Rongfang
- Abstract
Multi-access edge computing (MEC) is a promising computing paradigm that incorporates computing capability into a radio access network (RAN) nearby user equipment (UE) to improve the quality of experience. However, MEC also encounters many challenges inherent in RANs, such as mobility management. In this letter, we develop a novel computation offloading scheme utilizing non-orthogonal multiple access (NOMA) and dual connectivity (DC) and focus on jointly optimizing task segmentation and power allocation to minimize the total energy consumption. Specifically, the joint optimization problem is formulated as a mixed-integer nonlinear programming (MINLP) problem that is non-deterministic polynomial hard (NP-hard). To solve this problem, we propose a new heuristic algorithm to obtain a sub-optimal solution. We then propose an online learning algorithm based on a twin delayed deep deterministic policy gradient (TD3) to meet user mobility requirements. The numerical results show that the proposed scheme outperforms other schemes, and the TD3-based algorithm has comparable energy consumption performance and dramatically reduces the execution time compared with the heuristic algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
32. Massive Grant-Free OFDMA With Timing and Frequency Offsets.
- Author
-
Sun, Gangle, Li, Yining, Yi, Xinping, Wang, Wenjin, Gao, Xiqi, Wang, Lei, Wei, Fan, and Chen, Yan
- Abstract
In the massive grant-free orthogonal frequency division multiple access (OFDMA), the timing and frequency offsets between users impose new challenges on joint active user detection (AUD) and channel estimation (CE) for the subsequent data recovery. In the asynchronous OFDMA, the timing and frequency offset effects can be modeled as the phase-shifting on the pilot matrix. As such, by constructing the measurement matrix with timing and frequency offsets, the joint estimation problem can be formulated as a multiple measurement vector (MMV) recovery problem with structured sparsity. However, such structured sparsity cannot be tackled by the existing compressed sensing (CS) techniques. To address this issue, we develop an efficient structured generalized approximate message passing (S-GAMP) algorithm, which includes the parallel AMP-MMV algorithm as a particular case. To deal with the high dimensionality of the measurement matrix, we propose the dynamic S-GAMP algorithm with a dynamic measurement matrix to reduce the computational complexity. Simulation results confirm the superiority of the proposed algorithms in grant-free OFDMA with both timing and frequency offsets. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
33. Continuous Monitoring of Maximum Clique Over Dynamic Graphs.
- Author
-
Sun, Shengli, Li, Weiping, Wang, Yimo, Liao, Weilong, and Yu, Philip S.
- Subjects
- *
SEED size , *CLASSIFICATION algorithms , *PARALLEL algorithms , *CHARTS, diagrams, etc. , *APPROXIMATION algorithms , *HEURISTIC algorithms - Abstract
The maximum clique problem (MCP) has various applications to reveal the structure and function of graphs. Graphs are constantly updated in the real life. However, no algorithm is specifically designed for dynamic graph. Although MCP in dynamic graphs can be solved by simply invoking a state-of-the-art static approach, such as PMC, when the graph is updated, such an approach of simply re-calculating from scratch is inefficient. The key issue with MCP algorithm is to find a large clique, namely a seed, as fast as possible. Thus, search space can be pruned based on the seed. Size of the seed greedily found by PMC cannot be guaranteed, as it fluctuates considerably. Moreover, the time required to find a seed under PMC is up to $O(| E| \cdot \Delta (G))$ O (| E | · Δ (G)) , where $\Delta (G)$ Δ (G) is the highest degree in G. In this article, we intend to find a sizable seed by updating the previous maximum clique with the incident vertices of the inserted/deleted edge. Size of the seed now is guaranteed to be no less than $\omega (G^{\prime})\; - \;1$ ω (G ') - 1 , where $\omega (G^{\prime})$ ω (G ') is the size of the maximum clique on the updated graph. Moreover, the seed can be found in a time complexity of $O(\Delta (G)^{2})$ O (Δ (G) 2) . Two other crucial issues related to the MCP in dynamic graphs are refreshing rate and refreshing overhead. After a tight upper bound is imposed on $\omega (G^{\prime})$ ω (G ') , the necessity of refreshing is evaluated by comparing the seed with its largest challenger, then unnecessary refreshing is wiped out effectively. The size of the largest challenger is judiciously estimated using a lazy growth strategy. Subsequently, the search space in refreshing is confined on a much smaller subgraph using a local refreshing strategy. Extensive experiments indicate that the proposed approach outperforms the baseline algorithm by approximately one order of magnitude. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
34. An Efficient Split-Merge Re-Start for the $K$ K -Means Algorithm.
- Author
-
Capo, Marco, Perez, Aritz, and Lozano, Jose A.
- Subjects
- *
ALGORITHMS , *APPROXIMATION error , *APPROXIMATION algorithms , *PARALLEL algorithms , *HEURISTIC algorithms - Abstract
The $K$ K -means algorithm is one of the most popular clustering methods. However, it is a well-known fact that its performance, in terms of quality of the obtained solution and computational load, highly depends upon its initialization phase. For this reason, different initialization techniques have been developed throughout the years to enable its fast convergence to competitive solutions. In this sense, it is common practice to re-start the $K$ K -means algorithm several times via one of these techniques and keep the solution with the lowest error. Unfortunately, such a choice is still likely to be a poor approximation of the optimal set of centroids. In this article, we introduce a cheap Split-Merge step that can be used to re-start the $K$ K -means algorithm after reaching a fixed point. Under some settings, one can show that this approach reduces the error of the given fixed point without requiring any further iteration of the $K$ K -means algorithm. Moreover, experimental results show that this strategy is able to generate approximations with an associated error that is hard to reach for different multi-start methods, such as multi-start Forgy $K$ K -means, $K$ K -means++ and Hartigan $K$ K -means, while also computing a lower amount of distances than the previous algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
35. Active Learning for Estimating Reachable Sets for Systems With Unknown Dynamics.
- Author
-
Chakrabarty, Ankush, Danielson, Claus, Cairano, Stefano Di, and Raghunathan, Arvind
- Abstract
This article presents a data-driven method for computing reachable sets where active learning (AL) is used to reduce the computational burden. Set-based methods used to estimate reachable sets typically do not scale well with the state-space dimension, or rely heavily on the existence of a model. If such a model is not available, it is simple to generate state trajectory data by numerically simulating black-box oracles of systems (whose dynamics are unknown) from sampled initial conditions. Using these data samples, the estimation of reachable sets can be posed as a classification problem, wherein AL can intelligently select samples that are most informative and least similar to previously labeled samples. By exploiting submodularity, the actively learned samples can be selected efficiently, with bounded suboptimality. Our proposed framework is illustrated by estimating the domains of attractions of model predictive controllers (MPCs) and reinforcement learners. We also consider a scenario where there are two oracles that differ with respect to evaluation costs and labeling accuracy. We propose a framework to reduce the dependency of the expensive oracle in labeling samples using disagreement-based AL (DBAL). The potential of the DBAL algorithm is demonstrated on a solver selection problem for real-time MPC. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
36. Dynamic Event-Triggering Neural Learning Control for Partially Unknown Nonlinear Systems.
- Author
-
Mu, Chaoxu, Wang, Ke, and Qiu, Tie
- Abstract
This article presents an event-sampled integral reinforcement learning algorithm for partially unknown nonlinear systems using a novel dynamic event-triggering strategy. This is a novel attempt to introduce the dynamic triggering into the adaptive learning process. The core of this algorithm is the policy iteration technique, which is implemented by two neural networks. A critic network is periodically tuned using the integral reinforcement signal, and an actor network adopts the event-based communication to update the control policy only at triggering instants. For overcoming the deficiency of static triggering, a dynamic triggering rule is proposed to determine the occurrence of events, in which an internal dynamic variable characterized by a first-order filter is defined. Theoretical results indicate that the impulsive system driven by events is asymptotically stable, the network weight is convergent, and the Zeno behavior is successfully avoided. Finally, three examples are provided to demonstrate that the proposed dynamic triggering algorithm can reduce samples and transmissions even more, with guaranteed learning performance. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
37. A Successive Linearization in Feasible Set Algorithm for Vehicle Motion Planning in Unstructured and Low-Speed Scenarios.
- Author
-
Sun, Chaoyi, Li, Qing, Li, Bai, and Li, Li
- Abstract
Motion planning in unstructured and low-speed environments is a fundamental and difficult task for all mobile robotics. If we view motion planning as an optimization problem, the non-convex collision avoidance constraints and the nonlinear vehicle dynamic constraints make motion planning challenging and time-consuming. In this paper, we propose a Successive Linearization in Feasible Set (SLiFS) algorithm to address these two difficulties. SLiFS consists of two steps. The first step is to iteratively construct convex feasible sets around the current trajectory to approximate non-convex collision avoidance constraints. The second step is to successively linearize the nonlinear dynamic constraints along the current trajectory and further penalize them into the objective function to avoid infeasible linearized constraints, so that the current trajectory can be reshaped within the obtained convex feasible sets by iteratively solving the linearized optimization problem. The main innovation of SLiFS algorithm is that we consider the $L_{1}$ norm type penalty function in the second step. We find that the sparsity of the $L_{1}$ norm might help to satisfy the robotic dynamic constraints by numerical experiments. Numerical testing results show that our proposed SLiFS algorithm has a high success rate to find feasible trajectories and costs much less time than the classical interior-point method. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
38. GBNRS: A Novel Rough Set Algorithm for Fast Adaptive Attribute Reduction in Classification.
- Author
-
Xia, Shuyin, Zhang, Hao, Li, Wenhua, Wang, Guoyin, Giem, Elisabeth, and Chen, Zizhong
- Subjects
- *
ROUGH sets , *MEMBERSHIP functions (Fuzzy logic) , *ALGORITHMS , *CONTINUOUS processing , *BIG data , *RADIUS (Geometry) - Abstract
Feature reduction is an important aspect of Big Data analytics on today’s ever-larger datasets. Rough sets are a classical method widely applied in attribute reduction. Most rough set algorithms use the priori domain knowledge of a dataset to process continuous attributes through using a membership function. Neighborhood rough sets (NRS) replace the membership function with the concept of neighborhoods, allowing NRS to handle scenarios where no a priori knowledge is available. However, the neighborhood radius of each object in NRS is fixed, and the optimization of the radius depends on grid searching. This diminishes both the efficiency and effectiveness, leading to a time complexity of not lower than $O(N^2)$ O (N 2) . To resolve these limitations, granular ball neighborhood rough sets (GBNRS), a novel NRS method with time complexity $O(N)$ O (N) , is proposed. GBNRS adaptively generates a different neighborhood for each object, resulting in greater generality and flexibility in comparison to standard NRS methods. GBNRS is compared with the current state-of-the-art NRS method, FARNeMF, and find that GBNRS obtains both higher performance and higher classification accuracy on public benchmark datasets. All code has been released in the open source GBNRS library at http://www.cquptshuyinxia.com/GBNRS.html. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
39. Chebyshev Functional Link Spline Neural Filter for Nonlinear Dynamic System Identification.
- Author
-
Zhang, Zhao and Zhang, Jiashu
- Abstract
In order to increase the nonlinear fitting performance of functional link neural network (FLNN), a novel chebyshev functional link spline neural filter (CFLSNF) to apply in system identification is proposed. Compared with the weak nonlinearity and boundedness of the fixed activation function (e.g., $sigmoid$ and $tanh$), CFLSNF has stronger nonlinear approximation ability than FLNN due to the flexible interpolation ability of spline activation function. At the same time, the proposed CFLSNF eliminates the hidden layers by using Chebyshev polynomial to extend the input space into high dimensions, which shows certain computational advantages compared with the artificial neural network (ANN) structures. Moreover, to update the weights of the CFLSNF, the CFLSNF-LMS is also developed. The stability conditions and computational complexity are studied. Besides, in order to make CFLSNF structure suitable for impulsive noise interference environment, a robust algorithm based on maximum versoria criterion is also proposed. Finally, the validity of the proposed architecture and algorithm are verified by experiments. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
40. Hybrid Imitation Learning for Real-Time Service Restoration in Resilient Distribution Systems.
- Author
-
Zhang, Yichen, Qiu, Feng, Hong, Tianqi, Wang, Zhaoyu, and Li, Fangxing
- Abstract
Self-healing capability is a critical factor for a resilient distribution system, which requires intelligent agents to automatically perform service restoration online, including network reconfiguration and reactive power dispatch. The article proposes the imitation learning framework for training such an agent, where the agent will interact with an expert built based on the mixed-integer program to learn its optimal policy, and therefore significantly improve the training efficiency compared with exploration-dominant reinforcement learning (RL) methods. This significantly improved training efficiency makes the training problem under $N-k$ scenarios tractable. A hybrid policy network is proposed to handle tie-line operations and reactive power dispatch simultaneously to further improve the restoration performance. The 33-bus and 119-bus systems with $N-k$ disturbances are employed to conduct the training. The results indicate that the proposed method outperforms traditional RL algorithms such as the deep-Q network. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
41. Convexity and Feedback in Approximate Dynamic Programming for Delivery Time Slot Pricing.
- Author
-
Lebedev, Denis, Margellos, Kostas, and Goulart, Paul
- Subjects
DYNAMIC programming ,REVENUE management ,NUMERICAL analysis ,HEURISTIC algorithms ,APPROXIMATION algorithms ,PSYCHOLOGICAL feedback ,CHILDBIRTH at home - Abstract
We consider the revenue management problem of finding profit-maximizing prices for delivery time slots in the context of attended home delivery. This multistage optimal control problem admits a dynamic programming (DP) formulation that is intractable for realistic problem sizes due to the so-called “curse of dimensionality.” We therefore study three approximate DP algorithms both from a numerical and control-theoretical perspective. Our analysis is based on real-world data, from which we generate multiple scenarios to stress-test the robustness of the pricing policies to errors in model parameter estimates. Our theoretical analysis and numerical benchmark tests indicate that one of these algorithms, namely gradient-bounded DP, dominates the others with respect to computation time and profit-generation capabilities of the pricing policies that it generates. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
42. Online Reinforcement Learning Control by Direct Heuristic Dynamic Programming: From Time-Driven to Event-Driven.
- Author
-
Zhao, Qingtao, Si, Jennie, and Sun, Jian
- Subjects
- *
HEURISTIC programming , *DYNAMIC programming , *REINFORCEMENT learning , *ONLINE education , *LYAPUNOV functions , *MACHINE learning - Abstract
In this work, time-driven learning refers to the machine learning method that updates parameters in a prediction model continuously as new data arrives. Among existing approximate dynamic programming (ADP) and reinforcement learning (RL) algorithms, the direct heuristic dynamic programming (dHDP) has been shown an effective tool as demonstrated in solving several complex learning control problems. It continuously updates the control policy and the critic as system states continuously evolve. It is therefore desirable to prevent the time-driven dHDP from updating due to insignificant system event such as noise. Toward this goal, we propose a new event-driven dHDP. By constructing a Lyapunov function candidate, we prove the uniformly ultimately boundedness (UUB) of the system states and the weights in the critic and the control policy networks. Consequently, we show the approximate control and cost-to-go function approaching Bellman optimality within a finite bound. We also illustrate how the event-driven dHDP algorithm works in comparison to the original time-driven dHDP. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
43. An Energy-Efficient Approximate Divider Based on Logarithmic Conversion and Piecewise Constant Approximation.
- Author
-
Wu, Yong, Jiang, Honglan, Ma, Zining, Gou, Pengfei, Lu, Yong, Han, Jie, Yin, Shouyi, Wei, Shaojun, and Liu, Leibo
- Subjects
- *
HEURISTIC algorithms , *HEURISTIC , *SEARCH algorithms , *STATISTICAL errors , *IMAGE processing , *APPROXIMATION algorithms - Abstract
Approximate computing (AC) has been considered as a promising paradigm to improve the energy-efficiency of computing hardware for error-tolerant applications, with negligible quality degradation to the output. Dividers frequently limit the performance of a computing system; however, they have not received as much attention as multipliers and adders in AC. In this paper, an energy-efficient and high-performance approximate divider is proposed based on logarithmic conversion and piecewise constant approximation. In this design, the range for the conversion between binary and logarithmic numbers is first expanded from $\mathbf {[{0,1}]}$ to $\mathbf {[-0.5,1]}$. A heuristic search algorithm is then devised to find the most accurate constant set to approximate the reciprocal of the divisor, by minimizing a statistical error. The hardware implementation is presented for both floating-point (FP) and integer dividers. With a high configurability, the proposed divider results in a mean relative error distance (MRED) from 2.78% to 0.046%, indicating a high accuracy among state-of-the-art approximate dividers. Compared to the half-precision FP divider, the proposed divider with a MRED of 0.74% can achieve nearly $\mathbf {90\times }$ improvement in PDP. Moreover, compared to state-of-the-art approximate dividers, the proposed design is in the Pareto Frontier in terms of power delay product (PDP) and MRED. The three image processing application results demonstrate that the proposed divider can result in the highest peak signal-to-noise ratio (PSNR) and structural similarity (SSIM) even with truncation. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
44. Decoupled Data-Based Approach for Learning to Control Nonlinear Dynamical Systems.
- Author
-
Wang, Ran, Parunandi, Karthikeya S., Yu, Dan, Kalathil, Dileep, and Chakravorty, Suman
- Subjects
- *
NONLINEAR dynamical systems , *TRAJECTORY optimization , *DYNAMIC programming , *DYNAMICAL systems - Abstract
This article addresses the problem of learning the optimal control policy for a nonlinear stochastic dynamical. This problem is subject to the “curse of dimensionality” associated with the dynamic programming method. This article proposes a novel decoupled data-based control (D2C) algorithm that addresses this problem using a decoupled, “open-loop–closed-loop,” approach. First, an open-loop deterministic trajectory optimization problem is solved using a black-box simulation model of the dynamical system. Then, closed-loop control is developed around this open-loop trajectory by linearization of the dynamics about this nominal trajectory. By virtue of linearization, a linear quadratic regulator based algorithm can be used for this closed-loop control. We show that the performance of D2C algorithm is approximately optimal. Moreover, simulation performance suggests a significant reduction in training time compared to other state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
45. Parallel Computation of 3D Clipped Voronoi Diagrams.
- Author
-
Liu, Xiaohan, Ma, Lei, Guo, Jianwei, and Yan, Dong-Ming
- Subjects
BISECTORS (Geometry) ,MAGNITUDE (Mathematics) ,TETRAHEDRA ,VORONOI polygons ,POLYGONS ,GRAPHICS processing units - Abstract
Computing the Voronoi diagram of a given set of points in a restricted domain (e.g., inside a 2D polygon, on a 3D surface, or within a volume) has many applications. Although existing algorithms can compute 2D and surface Voronoi diagrams in parallel on graphics hardware, computing clipped Voronoi diagrams within volumes remains a challenge. This article proposes an efficient GPU algorithm to tackle this problem. A preprocessing step discretizes the input volume into a tetrahedral mesh. Then, unlike existing approaches which use the bisecting planes of the Voronoi cells to clip the tetrahedra, we use the four planes of each tetrahedron to clip the Voronoi cells. This strategy drastically simplifies the computation, and as a result, it outperforms state-of-the-art CPU methods up to an order of magnitude. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
46. Transfer Learning-Based Parallel Evolutionary Algorithm Framework for Bilevel Optimization.
- Author
-
Chen, Lei, Liu, Hai-Lin, Tan, Kay Chen, and Li, Ke
- Subjects
EVOLUTIONARY algorithms ,PARALLEL algorithms ,DIFFERENTIAL evolution ,BILEVEL programming ,COVARIANCE matrices ,BENCHMARK problems (Computer science) ,LEARNING strategies ,TECHNOLOGY transfer - Abstract
Evolutionary algorithms (EAs) have been recognized as a promising approach for bilevel optimization. However, the population-based characteristic of EAs largely influences their efficiency and effectiveness due to the nested structure of the two levels of optimization problems. In this article, we propose a transfer learning-based parallel EA (TLEA) framework for bilevel optimization. In this framework, the task of optimizing a set of lower level problems parameterized by upper level variables is conducted in a parallel manner. In the meanwhile, a transfer learning strategy is developed to improve the effectiveness of each lower level search (LLS) process. In practice, we implement two versions of the TLEA: the first version uses the covariance matrix adaptation evolutionary strategy and the second version uses the differential evolution as the evolutionary operator in lower level optimization. The experimental studies on two sets of widely used bilevel optimization benchmark problems are conducted, and the performance of the two TLEA implementations is compared to that of four well-established evolutionary bilevel optimization algorithms to verify the effectiveness and efficiency of the proposed algorithm framework. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
47. Online Koopman Operator Learning to Identify Cross-Coupling Effect of Piezoelectric Tube Scanners in Atomic Force Microscopes.
- Author
-
Huang, Xiang, Zhou, Wei, Li, Xiuting, Zhu, LiMin, and Zhang, Hai-Tao
- Abstract
As one of the most significant applications of nanopositioning technology, the tremendous development of atomic force microscopes (AFMs) has been witnessed these years. Essentially, the scanning motions of AFMs are generally driven by piezoelectric tube scanners (PTSs), whose cross-coupling effect hinders their high speed and high-precision positioning. Therefore, it becomes an urgent yet challenging mission to establish a niche model for the nonlinear cross-coupling dynamics of the PTS. As an emergent pure data-driven learning approach, the Koopman operator sheds some light on the PTS modeling methodology, which is thus adopted in this article to approximate the nonlinear cross-coupling dynamics of PTSs in an infinite-dimensional space. Moreover, an online high-order extended dynamic mode decomposition algorithm is proposed for the finite-dimensional approximation of the Koopman operator online. The merit of the present model lies in updating the identified cross coupling upon the arrival of new data in an incremental way. Finally, experiments are conducted to approximate the X–Y axes cross coupling of PTSs of an NTMDT Prima AFM, which verifies the effectiveness and superiority of the proposed modeling algorithm. This article is expected to pave the way from the Koopman operator learning theory to real applications in dynamics modeling of abundant nanoscale measurement systems. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
48. Trade-Off Between Efficiency and Complexity in Multi-Stage Embedding of Multicast VNF Service Chains.
- Author
-
Asgarian, Mina, Mirjalily, Ghasem, and Luo, Zhi-Quan
- Abstract
In Network Function Virtualization (NFV), network functions are implemented as Virtual Network Functions (VNFs), that are software instances running on physical servers or network devices. In this letter, first, the problem of multicast service chain embedding on NFV-enabled substrate networks is formulated as Integer Linear Programming (ILP). Then, an approach based on Source-Destination-VNF (SDV) graph named Two-Stage SDV-based (TSDV) is proposed to solve the problem in a simple but sufficiently efficient way. This approach offers a trade-off between efficiency and complexity of the solution by decomposing the solution into two stages and by using SDV graph. At the first stage, the proper locations for deploying VNFs are determined, while at the second stage, the multicast routing tree is obtained by solving a simplified Linear Programming (LP) problem. The simulation results show that TSDV offers a good trade-off between efficiency and complexity as compared to other multi-stage methods. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
49. Aligning Points to Lines: Provable Approximations.
- Author
-
Jubran, Ibrahim and Feldman, Dan
- Subjects
- *
APPROXIMATION algorithms , *COMPUTATIONAL geometry , *COMBINATORICS , *MATHEMATICAL optimization , *EUCLIDEAN distance , *SOURCE code - Abstract
We suggest a new optimization technique for minimizing the sum $\sum _{i=1}^n g_i(x)$ ∑ i = 1 n g i (x) of $n$ n non-convex real functions that satisfy a property that we call piecewise log-Lipschitz. This is by forging links between techniques in computational geometry, combinatorics and convex optimization. As an example application, we provide the first constant-factor approximation algorithms whose running-times are polynomial in $n$ n for the fundamental problem of Points-to-Lines alignment: Given $n$ n points $p_1,\ldots,p_n$ p 1 ,... , p n and $n$ n lines $\ell _1,\ldots,\ell _n$ ℓ 1 ,... , ℓ n on the plane and $z>0$ z > 0 , compute the matching $\pi :[n]\to [n]$ π : [ n ] → [ n ] and alignment (rotation matrix $R$ R and translation vector $t$ t ) that minimize the sum of euclidean distances $\sum _{i=1}^n \mathrm{dist}(Rp_i-t,\ell _{\pi (i)})^z$ ∑ i = 1 n dist (R p i - t , ℓ π (i)) z between each point to its corresponding line. This problem is non-trivial even if $z=1$ z = 1 and the matching $\pi$ π is given. If $\pi$ π is given, our algorithms run in $O(n^3)$ O (n 3) time, and even near-linear in $n$ n using core-sets that support: streaming, dynamic, and distributed parallel computations in poly-logarithmic update time. Generalizations for handling e.g., outliers or pseudo-distances such as $M$ M -estimators for the problem are also provided. Experimental results and open source code show that our algorithms improve existing heuristics also in practice. A companion demonstration video in the context of Augmented Reality shows how such algorithms may be used in real-time systems. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
50. An Optimal Online Semi-Connected PLA Algorithm With Maximum Error Bound.
- Author
-
Zhao, Huanyu, Pang, Chaoyi, Kotagiri, Ramamohanarao, Pang, Christopher K., Deng, Ke, Yang, Jian, and Li, Tongliang
- Subjects
- *
PIECEWISE linear approximation , *ONLINE algorithms , *FIELD programmable gate arrays , *ALGORITHMS , *TIME series analysis , *TIMESTAMPS - Abstract
Piecewise Linear Approximation (PLA) is one of the most widely used approaches for representing a time series with a set of approximated line segments. With this compressed form of representation, many large complicated time series can be efficiently stored, transmitted and analyzed. In this article, with the introduced concept of “semi-connection” that allowing two representation lines to be connected at a point between two consecutive time stamps, we propose a new optimal linear-time PLA algorithm SemiOptConnAlg for generating the least number of semi-connected line segments with guaranteed maximum error bound. With extended experimental tests, we demonstrate that the proposed algorithm is very efficient in execution time and achieves better performances than the state-of-art solutions. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.