Features:

Bug Fixes/Re-organization:

	- Spaces Function Class Normed R^x To Finite - Operator Sample Supremum Norm (1)
	- Spaces Function Class Normed R^x To Finite - Agnostic Covering Number Bounds (2)
	- Spaces Function Class Normed R^x To Finite - Scale Sensitive Covering Bounds #1 (3)
	- Spaces Function Class Normed R^x To Finite - Scale Sensitive Covering Bounds #2 (4, 5, 6)
	- Spaces Function Class Normed R^x To Finite - Scale Sensitive Covering Bounds #3 (7, 8, 9)
	- Spaces Function Class Normed R^x To Finite - Scale Sensitive Covering Bounds #4 (10, 11, 12)
	- Spaces Function Class Normed R^x To Finite - Output Dimension (13, 14)
	- Spaces Function Class Normed R^x To Finite - Population Metric Covering Bounds (15, 16)
	- Spaces Function Class Normed R^x To Finite - Population Supremum Covering Bounds (17, 18)
	- Spaces Function Class Normed R^x To Finite - Sample Metric Covering Bounds (19, 20)
	- Spaces Function Class Normed R^x To Finite - Sample Supremum Covering Bounds (21, 22)
	- Spaces Function Class Normed R^x To R^1 Finite (23, 24, 25)
	- Spaces Function Class Normed R^x To R^1 Finite - Array (26, 27)
	- Spaces Function Class Normed R^x To R^1 Finite - Constructor #1 (28, 29)
	- Spaces Function Class Normed R^x To R^1 Finite - Constructor #2 (30, 31)
	- Spaces Function Class Normed R^x To R^1 Finite - Agnostic Covering Number Bounds (32)
	- Spaces Function Class Normed R^x To R^1 Finite - Input Metric Vector Space (33)
	- Spaces Function Class Normed R^x To R^1 Finite - Output Metric Vector Space (34)
	- Spaces Function Class Normed R^x To R^1 Finite - Population Covering Number #1 (35, 36)
	- Spaces Function Class Normed R^x To R^1 Finite - Population Covering Number #2 (37, 38, 39)
	- Spaces Function Class Normed R^x To R^1 Finite - Population Covering Number #3 (40, 41)
	- Spaces Function Class Normed R^x To R^1 Finite - Population Supremum Covering Number #1 (42)
	- Spaces Function Class Normed R^x To R^1 Finite - Population Supremum Covering Number #2 (43, 44, 45)
	- Spaces Function Class Normed R^x To R^1 Finite - Population Supremum Covering Number #3 (46, 47, 48)
	- Spaces Function Class Normed R^x To R^1 Finite - Sample Covering Number #1 (49, 50, 51)
	- Spaces Function Class Normed R^x To R^1 Finite - Sample Covering Number #2 (52, 53, 54)
	- Spaces Function Class Normed R^x To R^1 Finite - Sample Covering Number #3 (55)
	- Spaces Function Class Normed R^x To R^1 Finite - Sample Supremum Covering Number #1 (56, 57)
	- Spaces Function Class Normed R^x To R^1 Finite - Sample Supremum Covering Number #2 (58, 59, 60)


Samples:

IdeaDRIP:

Author: Lakshmik

ReleaseNotes/09_13_2023.txt

@@ -0,0 +1,46 @@
+
+Features:
+
+Bug Fixes/Re-organization:
+
+	- Spaces Cover Maurey Operator Covering Bounds - Constant - from the Williamson-Smola-Scholkopf Estimate (1)
+	- Spaces Cover Maurey Operator Covering Bounds - Supremum Dimension (2, 3)
+	- Spaces Cover Maurey Operator Covering Bounds - Norm (4, 5)
+	- Spaces Cover Maurey Operator Covering Bounds - Constant (6, 7)
+	- Spaces Cover Maurey Operator Covering Bounds - Hilbert Supremum Identity Map (8, 9)
+	- Spaces Cover Maurey Operator Covering Bounds - Williamson Smola Scholkopf Estimate (10, 11)
+	- Spaces Cover Maurey Operator Covering Bounds - Constructor (12)
+	- Spaces Cover Maurey Operator Covering Bounds - Dyadic Entropy Upper Bound (13, 14)
+	- Spaces Cover Maurey Operator Covering Bounds - Entropy Number Upper Bound (15, 16, 17)
+	- Spaces Cover Operator Class Covering Bounds (18, 19, 20)
+	- Spaces Cover Operator Class Covering Bounds - Entropy Number Lower Bound (21)
+	- Spaces Cover Operator Class Covering Bounds - Entropy Number Upper Bound (22)
+	- Spaces Cover Operator Class Covering Bounds - Entropy Number Index (23)
+	- Spaces Cover Operator Class Covering Bounds - Norm (24)
+	- Spaces Cover Operator Class Covering Bounds - Entropy Number Asymptote (25)
+	- Spaces Cover Scale Sensitive Covering Bounds (26, 27, 28)
+	- Spaces Cover Scale Sensitive Covering Bounds - Sample Size (29, 30)
+	- Spaces Cover Scale Sensitive Covering Bounds - R^1 Fat Shatter (31, 32)
+	- Spaces Cover Scale Sensitive Covering Bounds - Constructor (33)
+	- Spaces Cover Scale Sensitive Covering Bounds - Sample Size Lower Bound (34, 35, 36)
+	- Spaces Cover Scale Sensitive Covering Bounds - Restricted Subset Cardinality #1 (37, 38, 39)
+	- Spaces Cover Scale Sensitive Covering Bounds - Restricted Subset Cardinality #2 (40, 41)
+	- Spaces Cover Scale Sensitive Covering Bounds - Upper Probability Bound Weight (42, 43)
+	- Spaces Cover Scale Sensitive Covering Bounds - Log Lower Bound (44)
+	- Spaces Cover Scale Sensitive Covering Bounds - Log Upper Bound (45)
+	- Spaces Function Class Hilbert R^x To Supremum R^d Finite (46, 47)
+	- Spaces Function Class Hilbert R^x To Supremum R^d Finite - Constructor (48)
+	- Spaces Function Class Normed R^x To Finite (49, 50, 51)
+	- Spaces Function Class Normed R^x To Finite - Maurey Constant (52, 53)
+	- Spaces Function Class Normed R^x To Finite - Constructor (54)
+	- Spaces Function Class Normed R^x To Finite - Input Metric Vector Space (55)
+	- Spaces Function Class Normed R^x To Finite - Output Metric Vector Space (56)
+	- Spaces Function Class Normed R^x To Finite - Operator Population Metric Norm (57)
+	- Spaces Function Class Normed R^x To Finite - Operator Population Supremum Norm (58)
+	- Spaces Function Class Normed R^x To Finite - Operator Sample Metric Norm (59)
+	- Spaces Function Class Normed R^x To Finite - Operator Sample Supremum Norm (60)
+
+
+Samples:
+
+IdeaDRIP:

ReleaseNotes/09_14_2023.txt

@@ -0,0 +1,39 @@
+
+Features:
+
+Bug Fixes/Re-organization:
+
+	- Spaces Function Class Normed R^x To Finite - Operator Sample Supremum Norm (1)
+	- Spaces Function Class Normed R^x To Finite - Agnostic Covering Number Bounds (2)
+	- Spaces Function Class Normed R^x To Finite - Scale Sensitive Covering Bounds #1 (3)
+	- Spaces Function Class Normed R^x To Finite - Scale Sensitive Covering Bounds #2 (4, 5, 6)
+	- Spaces Function Class Normed R^x To Finite - Scale Sensitive Covering Bounds #3 (7, 8, 9)
+	- Spaces Function Class Normed R^x To Finite - Scale Sensitive Covering Bounds #4 (10, 11, 12)
+	- Spaces Function Class Normed R^x To Finite - Output Dimension (13, 14)
+	- Spaces Function Class Normed R^x To Finite - Population Metric Covering Bounds (15, 16)
+	- Spaces Function Class Normed R^x To Finite - Population Supremum Covering Bounds (17, 18)
+	- Spaces Function Class Normed R^x To Finite - Sample Metric Covering Bounds (19, 20)
+	- Spaces Function Class Normed R^x To Finite - Sample Supremum Covering Bounds (21, 22)
+	- Spaces Function Class Normed R^x To R^1 Finite (23, 24, 25)
+	- Spaces Function Class Normed R^x To R^1 Finite - Array (26, 27)
+	- Spaces Function Class Normed R^x To R^1 Finite - Constructor #1 (28, 29)
+	- Spaces Function Class Normed R^x To R^1 Finite - Constructor #2 (30, 31)
+	- Spaces Function Class Normed R^x To R^1 Finite - Agnostic Covering Number Bounds (32)
+	- Spaces Function Class Normed R^x To R^1 Finite - Input Metric Vector Space (33)
+	- Spaces Function Class Normed R^x To R^1 Finite - Output Metric Vector Space (34)
+	- Spaces Function Class Normed R^x To R^1 Finite - Population Covering Number #1 (35, 36)
+	- Spaces Function Class Normed R^x To R^1 Finite - Population Covering Number #2 (37, 38, 39)
+	- Spaces Function Class Normed R^x To R^1 Finite - Population Covering Number #3 (40, 41)
+	- Spaces Function Class Normed R^x To R^1 Finite - Population Supremum Covering Number #1 (42)
+	- Spaces Function Class Normed R^x To R^1 Finite - Population Supremum Covering Number #2 (43, 44, 45)
+	- Spaces Function Class Normed R^x To R^1 Finite - Population Supremum Covering Number #3 (46, 47, 48)
+	- Spaces Function Class Normed R^x To R^1 Finite - Sample Covering Number #1 (49, 50, 51)
+	- Spaces Function Class Normed R^x To R^1 Finite - Sample Covering Number #2 (52, 53, 54)
+	- Spaces Function Class Normed R^x To R^1 Finite - Sample Covering Number #3 (55)
+	- Spaces Function Class Normed R^x To R^1 Finite - Sample Supremum Covering Number #1 (56, 57)
+	- Spaces Function Class Normed R^x To R^1 Finite - Sample Supremum Covering Number #2 (58, 59, 60)
+
+
+Samples:
+
+IdeaDRIP:

ScheduleSheet.xlsx

@@ -1,6 +1,8 @@
 
 package org.drip.spaces.cover;
 
+import org.drip.numerical.common.NumberUtil;
+
 /*
  * -*- mode: java; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*-
  */
@@ -152,27 +154,30 @@ public class MaureyOperatorCoveringBounds
 
 	public static final double WILLIAMSON_SMOLA_SCHOLKOPF_CONSTANT = 103.;
 
-	private int _iSupremumDimension = -1;
-	private double _dblOperatorNorm = java.lang.Double.NaN;
-	private double _dblMaureyConstant = java.lang.Double.NaN;
+	private int _supremumDimension = -1;
+	private double _operatorNorm = Double.NaN;
+	private double _maureyConstant = Double.NaN;
 
 	/**
 	 * Construct an Instance Hilbert To Supremum Identity Map based Maurey Operator Covering Bounds
 	 * 
-	 * @param iSupremumDimension The Operator Supremum Output Space Dimension
-	 * @param dblOperatorNorm The Operator Norm of Interest
+	 * @param supremumDimension The Operator Supremum Output Space Dimension
+	 * @param operatorNorm The Operator Norm of Interest
 	 * 
 	 * @return The Instance Hilbert To Supremum Identity Map based Maurey Operator Covering Bounds
 	 */
 
 	public static final MaureyOperatorCoveringBounds HilbertSupremumIdentityMap (
-		final int iSupremumDimension,
-		final double dblOperatorNorm)
+		final int supremumDimension,
+		final double operatorNorm)
 	{
 		try {
-			return new MaureyOperatorCoveringBounds (HILBERT_SUPREMUM_IDENTITY_CONSTANT,
-				iSupremumDimension, dblOperatorNorm);
-		} catch (java.lang.Exception e) {
+			return new MaureyOperatorCoveringBounds (
+				HILBERT_SUPREMUM_IDENTITY_CONSTANT,
+				supremumDimension,
+				operatorNorm
+			);
+		} catch (Exception e) {
 			e.printStackTrace();
 		}
 
@@ -183,20 +188,23 @@ public static final MaureyOperatorCoveringBounds HilbertSupremumIdentityMap (
 	 * Construct an Instance of the Maurey Operator Covering Bounds based upon the Williamson, Smola, and
 	 *  Scholkopf Estimate
 	 * 
-	 * @param iSupremumDimension The Operator Supremum Output Space Dimension
-	 * @param dblOperatorNorm The Operator Norm of Interest
+	 * @param supremumDimension The Operator Supremum Output Space Dimension
+	 * @param operatorNorm The Operator Norm of Interest
 	 * 
 	 * @return Maurey Operator Covering Bounds based upon the Williamson, Smola, and Scholkopf Estimate
 	 */
 
 	public static final MaureyOperatorCoveringBounds WilliamsonSmolaScholkopfEstimate (
-		final int iSupremumDimension,
-		final double dblOperatorNorm)
+		final int supremumDimension,
+		final double operatorNorm)
 	{
 		try {
-			return new MaureyOperatorCoveringBounds (WILLIAMSON_SMOLA_SCHOLKOPF_CONSTANT,
-				iSupremumDimension, dblOperatorNorm);
-		} catch (java.lang.Exception e) {
+			return new MaureyOperatorCoveringBounds (
+				WILLIAMSON_SMOLA_SCHOLKOPF_CONSTANT,
+				supremumDimension,
+				operatorNorm
+			);
+		} catch (Exception e) {
 			e.printStackTrace();
 		}
 
@@ -206,23 +214,25 @@ public static final MaureyOperatorCoveringBounds WilliamsonSmolaScholkopfEstimat
 	/**
 	 * <i>MaureyOperatorCoveringBounds</i> Constructor
 	 * 
-	 * @param dblMaureyConstant The Maurey Constant
-	 * @param iSupremumDimension The Operator Supremum Output Space Dimension
-	 * @param dblOperatorNorm The Operator Norm of Interest
+	 * @param maureyConstant The Maurey Constant
+	 * @param supremumDimension The Operator Supremum Output Space Dimension
+	 * @param operatorNorm The Operator Norm of Interest
 	 * 
-	 * @throws java.lang.Exception Thrown if the Inputs are Invalid
+	 * @throws Exception Thrown if the Inputs are Invalid
 	 */
 
 	public MaureyOperatorCoveringBounds (
-		final double dblMaureyConstant,
-		final int iSupremumDimension,
-		final double dblOperatorNorm)
-		throws java.lang.Exception
+		final double maureyConstant,
+		final int supremumDimension,
+		final double operatorNorm)
+		throws Exception
 	{
-		if (!org.drip.numerical.common.NumberUtil.IsValid (_dblMaureyConstant = dblMaureyConstant) || 0 >=
-			(_iSupremumDimension = iSupremumDimension) || !org.drip.numerical.common.NumberUtil.IsValid
-				(_dblOperatorNorm = dblOperatorNorm))
-			throw new java.lang.Exception ("MaureyOperatorCoveringBounds ctr => Invalid Inputs");
+		if (!NumberUtil.IsValid (_maureyConstant = maureyConstant) ||
+			0 >= (_supremumDimension = supremumDimension) ||
+			!NumberUtil.IsValid (_operatorNorm = operatorNorm))
+		{
+			throw new Exception ("MaureyOperatorCoveringBounds ctr => Invalid Inputs");
+		}
 	}
 
 	/**
@@ -233,7 +243,7 @@ public MaureyOperatorCoveringBounds (
 
 	public double maureyConstant()
 	{
-		return _dblMaureyConstant;
+		return _maureyConstant;
 	}
 
 	/**
@@ -244,7 +254,7 @@ public double maureyConstant()
 
 	public int supremumDimension()
 	{
-		return _iSupremumDimension;
+		return _supremumDimension;
 	}
 
 	/**
@@ -255,52 +265,55 @@ public int supremumDimension()
 
 	public double operatorNorm()
 	{
-		return _dblOperatorNorm;
+		return _operatorNorm;
 	}
 
 	/**
 	 * Compute the Upper Bound for the Dyadic Entropy Number
 	 * 
-	 * @param iEntropyNumberIndex The Entropy Number Index
+	 * @param entropyNumberIndex The Entropy Number Index
 	 * 
 	 * @return The Upper Bound for the DyadicEntropy Number
 	 * 
-	 * @throws java.lang.Exception Thrown if the Inputs are Invalid
+	 * @throws Exception Thrown if the Inputs are Invalid
 	 */
 
 	public double dyadicEntropyUpperBound (
-		final int iEntropyNumberIndex)
-		throws java.lang.Exception
+		final int entropyNumberIndex)
+		throws Exception
 	{
-		if (0 >= iEntropyNumberIndex)
-			throw new java.lang.Exception
-				("MaureyOperatorCoveringBounds::dyadicEntropyUpperBound => Invalid Inputs");
+		if (0 >= entropyNumberIndex) {
+			throw new Exception ("MaureyOperatorCoveringBounds::dyadicEntropyUpperBound => Invalid Inputs");
+		}
 
-		return _dblMaureyConstant * _dblOperatorNorm * java.lang.Math.sqrt ((java.lang.Math.log (1. +
-			(((double) _iSupremumDimension) / ((double) iEntropyNumberIndex))) / iEntropyNumberIndex));
+		return _maureyConstant * _operatorNorm * Math.sqrt (
+			(Math.log (1. + (((double) _supremumDimension) / ((double) entropyNumberIndex))) /
+				entropyNumberIndex)
+		);
 	}
 
 	/**
 	 * Compute the Upper Bound for the Entropy Number
 	 * 
-	 * @param iEntropyNumberIndex The Entropy Number Index
+	 * @param entropyNumberIndex The Entropy Number Index
 	 * 
 	 * @return The Upper Bound for the Entropy Number
 	 * 
-	 * @throws java.lang.Exception Thrown if the Inputs are Invalid
+	 * @throws Exception Thrown if the Inputs are Invalid
 	 */
 
 	public double entropyNumberUpperBound (
-		final int iEntropyNumberIndex)
-		throws java.lang.Exception
+		final int entropyNumberIndex)
+		throws Exception
 	{
-		if (0 >= iEntropyNumberIndex)
-			throw new java.lang.Exception
-				("MaureyOperatorCoveringBounds::entropyNumberUpperBound => Invalid Inputs");
+		if (0 >= entropyNumberIndex) {
+			throw new Exception ("MaureyOperatorCoveringBounds::entropyNumberUpperBound => Invalid Inputs");
+		}
 
-		double dblLogNPlus1 = 1. + java.lang.Math.log (iEntropyNumberIndex);
+		double logNPlus1 = 1. + Math.log (entropyNumberIndex);
 
-		return _dblMaureyConstant * _dblOperatorNorm * java.lang.Math.sqrt ((1. + (((double)
-			_iSupremumDimension) / dblLogNPlus1)) / dblLogNPlus1);
+		return _maureyConstant * _operatorNorm * Math.sqrt (
+			(1. + (((double) _supremumDimension) / logNPlus1)) / logNPlus1
+		);
 	}
 }