9 January 2020 in IEEE Transactions on Image Processing
Learning to hash is a fundamental technique widely used in large-scale image retrieval. Most existing methods for learning to hash address the involved discrete optimization problem by the continuous relaxation of the binary constraint, which usually lead to large quantization errors and consequently suboptimal binary codes. A few discrete hashing methods have emerged recently. However, they either completely ignore some useful constraints (specifically the balance and decorrelation of hash bits) or just turn those constraints into regularizers that would make the optimization easier but less accurate. In this paper, we propose a novel supervised hashing method named, Strongly Constrained Discrete Hashing (SCDH), which overcomes such limitations. It can learn the binary codes for all examples in the training set, and meanwhile obtain a hash function for unseen samples with the above mentioned constraints preserved. Although the model of SCDH is fairly sophisticated, we are able to find closed-form solutions to all of its optimization subproblems and thus design an efficient algorithm that converges quickly. In addition, we extend SCDH to a kernelized version SCDHK. Our experiments on three large benchmark datasets have demonstrated that not only can SCDH and SCDHK achieve substantially higher MAP scores than state-of-the-art baselines, but they run much faster than those that are also supervised as well.
18 May 2020 in IEEE Transactions on Knowledge and Data Engineering
Due to the exponential growth of multimedia data, multi-modal hashing as a promising technique to make cross-view retrieval scalable is attracting more and more attention. However, most of the existing multi-modal hashing methods either divide the learning process unnaturally into two separate stages or treat the discrete optimization problem simplistically as a continuous one, which leads to suboptimal results. Recently, a few discrete multi-modal hashing methods that try to address such issues have emerged, but they still ignore several important discrete constraints (such as the balance and decorrelation of hash bits). In this paper, we overcome those limitations by proposing a novel method named “Enhanced Discrete Multi-modal Hashing (EDMH)” which learns binary codes and hashing functions simultaneously from the pairwise similarity matrix of data, under the aforementioned discrete constraints. Although the model of EDMH looks a lot more complex than the other models for multi-modal hashing, we are actually able to develop a fast iterative learning algorithm for it, since the subproblems of its optimization all have closed-form solutions after introducing a couple of auxiliary variables. Our experimental results on three real-world datasets have revealed the usefulness of those previously ignored discrete constraints and demonstrated that EDMH not only performs much better than state-of-the-art competitors according to several retrieval metrics but also runs much faster than most of them.
15 December 2017 in Artificial Intelligence Research
It is an important and challenging problem in unsupervised learning to estimate the number of clusters in a dataset. Knowing the number of clusters is a prerequisite for many commonly used clustering algorithms such as \textit{k}-means. In this paper, we propose a novel diversity based approach to this problem. Specifically, we show that the difference between the global diversity of clusters and the sum of each cluster’s local diversity of their members can be used as an effective indicator of the optimality of the number of clusters, where the diversity is measured by Rao’s quadratic entropy. A notable advantage of our proposed method is that it encourages balanced clustering by taking into account both the sizes of clusters and the distances between clusters. In other words, it is less prone to very small “outlier” clusters than existing methods. Our extensive experiments on both synthetic and real-world datasets (with known ground-truth clustering) have demonstrated that our proposed method is robust for clusters of different sizes, variances, and shapes, and it is more accurate than existing methods (including elbow, Caliński-Harabasz, silhouette, and gap-statistic) in terms of finding out the optimal number of clusters.
7 June 2024 in Neural Networks
27 November 2025 in Vicinagearth
Tool learning has emerged as a key capability for enhancing the reasoning and decision-making abilities of large language models (LLMs) by enabling them to interface with external tools such as application programming interfaces (APIs), search engines, and calculators. This survey provides a systematic overview of the tool learning paradigm, focusing on how LLMs can decompose complex tasks, select appropriate tools, invoke them correctly, and generate coherent responses. We summarize a unified four-stage framework comprising task planning, tool selection, task execution, and response generation, which captures the core processes underlying tool-augmented language modeling. We further analyze major learning methodologies, including tuning-free methods, supervised fine-tuning methods, and reinforcement learning, and discuss how they contribute to different stages of the tool-use pipeline. The survey also reviews recent benchmarks designed to evaluate tool-use competence across both general and domain-specific scenarios. Finally, we highlight open challenges in safety, efficiency, and generalization, and outline promising directions for future research. This work aims to serve as a conceptual roadmap and practical reference for researchers and developers working on tool-augmented artificial intelligence (AI) systems.
15 December 2004 in Journal of Web Semantics