Related papers: Interval-valued fuzzy soft $β$-covering approximation spaces

Related papers

GIST: Greedy Independent Set Thresholding for Diverse Data Summarization [21.69260104523751]
We propose a novel subset selection task called min-distance diverse data summarization ($textsfMDDS$) The goal is to maximize an objective that combines the total utility of the points and a diversity term that captures the minimum distance between any pair of selected points. This work presents the $textttGIST$ algorithm, which achieves a $frac23$-approximation guarantee for $textsfMDDS$.
arXiv Detail & Related papers (2024-05-29T04:39:24Z)
Foundational propositions of hesitant fuzzy soft $\beta$-covering approximation spaces [0.0]
Hesitant fuzzy sets exhibit diverse membership degrees, giving rise to various forms of inclusion relationships among them. This article introduces the notions of hesitant fuzzy soft $beta$-coverings and hesitant fuzzy soft $beta$-neighborhoods.
arXiv Detail & Related papers (2024-03-08T13:16:17Z)
Nearly Minimax Optimal Regret for Learning Linear Mixture Stochastic Shortest Path [80.60592344361073]
We study the Shortest Path (SSP) problem with a linear mixture transition kernel. An agent repeatedly interacts with a environment and seeks to reach certain goal state while minimizing the cumulative cost. Existing works often assume a strictly positive lower bound of the iteration cost function or an upper bound of the expected length for the optimal policy.
arXiv Detail & Related papers (2024-02-14T07:52:00Z)
Diversity-aware clustering: Computational Complexity and Approximation Algorithms [18.009333081689498]
We study diversity-aware clustering problems where the data points are associated with multiple attributes resulting in intersecting groups.<n>A clustering solution needs to ensure that the number of chosen cluster centers from each group should be within the range defined by a lower and upper bound threshold for each group.<n>We present parameterized approximation algorithms with approximation ratios $1+ frac2e + epsilon approx 1.736$+frac8e + epsilon approx 3.943$, and $5$ for diversity-aware $k$-median, diversity-aware $
arXiv Detail & Related papers (2024-01-10T19:01:05Z)
Ensemble sampling for linear bandits: small ensembles suffice [75.4286948336835]
We provide the first useful and rigorous analysis of ensemble sampling for the linear bandit setting. Ours is the first result in any structured setting not to require the size of the ensemble to scale linearly with $T$ -- while obtaining near $smashsqrtT$ order regret.
arXiv Detail & Related papers (2023-11-14T18:41:28Z)
Sharper Bounds for $\ell_p$ Sensitivity Sampling [56.45770306797584]
We show the first bounds for sensitivity sampling for $ell_p$ subspace embeddings for $p. We also show that the root leverage score sampling algorithm achieves a bound of roughly $d$ for $1leq p2$, and that a combination of leverage score and sensitivity sampling achieves an improved bound of roughly $d2/pmathfrak S2-4/p$ for $2pinfty.
arXiv Detail & Related papers (2023-06-01T14:27:28Z)
$(O,G)$-granular variable precision fuzzy rough sets based on overlap and grouping functions [16.843434476423305]
In this paper, the depiction of $(O,G)$-granular variable precision fuzzy rough sets ($(O,G)$-GVPFRSs for short) is first given based on overlap and grouping functions. To work out the approximation operators efficiently, we give another expression of upper and lower approximation operators by means of fuzzy implications. Some conclusions on the granular variable precision fuzzy rough sets (GVPFRSs for short) are extended to $(O,G)$-GVPFRSs under some additional conditions.
arXiv Detail & Related papers (2022-05-18T04:37:15Z)
On three types of $L$-fuzzy $\beta$-covering-based rough sets [16.843434476423305]
We study the axiom sets, matrix representations and interdependency of three pairs of $L$-fuzzy $beta$-covering-based rough approximation operators. We present the necessary and sufficient conditions under which two $L$-fuzzy $beta$-coverings can generate the same lower and upper rough approximation operations.
arXiv Detail & Related papers (2022-05-13T05:30:51Z)
Nearly Optimal Algorithms for Level Set Estimation [21.83736847203543]
We provide a new approach to the level set estimation problem by relating it to recent adaptive experimental design methods for linear bandits. We show that our bounds are nearly optimal, namely, our upper bounds match existing lower bounds for threshold linear bandits.
arXiv Detail & Related papers (2021-11-02T17:45:02Z)
High-Dimensional Sparse Linear Bandits [67.9378546011416]
We derive a novel $Omega(n2/3)$ dimension-free minimax regret lower bound for sparse linear bandits in the data-poor regime. We also prove a dimension-free $O(sqrtn)$ regret upper bound under an additional assumption on the magnitude of the signal for relevant features.
arXiv Detail & Related papers (2020-11-08T16:48:11Z)
The Influence of Shape Constraints on the Thresholding Bandit Problem [74.73898216415049]
We investigate the Thresholding Bandit problem (TBP) under several shape constraints. In the TBP problem the aim is to output, at the end of the sequential game, the set of arms whose means are above a given threshold. We prove that the minimax rates for the regret are (i) $sqrtlog(K)K/T$ for TBP, (ii) $sqrtlog(K)/T$ for UTBP, (iii) $sqrtK/T$ for CTBP and (iv)
arXiv Detail & Related papers (2020-06-17T17:12:32Z)
Agnostic Q-learning with Function Approximation in Deterministic Systems: Tight Bounds on Approximation Error and Sample Complexity [94.37110094442136]
We study the problem of agnostic $Q$-learning with function approximation in deterministic systems. We show that if $delta = Oleft(rho/sqrtdim_Eright)$, then one can find the optimal policy using $Oleft(dim_Eright)$.
arXiv Detail & Related papers (2020-02-17T18:41:49Z)
Coresets for the Nearest-Neighbor Rule [78.15296214629433]
Nearest-neighbor condensation deals with finding a subset $R subseteq P$. This paper introduces the concept of coresets for nearest-neighbor classification. We propose quadratic-time approximation algorithms with provable upper-bounds on the size of their selected subsets.
arXiv Detail & Related papers (2020-02-16T19:00:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.