Pith. sign in

REVIEW 2 major objections 5 minor 31 references

A Theory of Goal-Oriented Medium Access: Protocol Design and Distributed Bandit Learning

T0 review · 2 major / 5 minor · reviewed 2026-08-05 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read This paper tries to establish that distributed goal-oriented medium access reduces to a per-node threshold on the value of information, with best-response and bandit learning reaching a locally optimal equilibrium.

desk verdict The threshold best-response result is the real contribution; the BETA convergence guarantee does not follow from the supplied proof. read the letter →

arxiv 2508.19141 v1 pith:YDYP6BMG submitted 2025-08-26 cs.NI math.OC

Federico Chiariotti , Andrea Zanella This is my paper
classification cs.NImath.OC
keywords goal-orientedcommunicationvalueofinformationmediumaccesscontrolthresholdstrategiesiteratedbestresponsemulti-armedbanditsNashequilibriumwirelesssensornetworks
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper aims to show that when several sensors share a collision channel, the right medium-access rule is not to elect a single dominant transmitter but to let each node transmit only when its measurement's value of information is high enough. It proves that, given the other nodes' strategies, each node's optimal response is a threshold policy, and that the resulting best-response dynamics converge to a locally optimal Nash equilibrium. On top of this it builds LIBRA, an iterative protocol that approaches such an equilibrium from a fair starting point, and BETA, a distributed bandit learner that reaches nearly the same performance without knowing the value distributions in advance. In simulations, the approach outperforms centralized pull-based scheduling by up to 100% in reward while using 20–30% less energy and spreading load more fairly.

What carries the argument

The load-bearing object is the threshold best-response map of Theorem 2 (and its continuous counterpart Theorem 3). It turns a per-node optimization over a continuum of transmission probabilities into a single number: the threshold theta*_n, equal to the normalized expected value of other nodes' transmissions plus the transmission cost divided by the probability that all others are silent. This map makes the problem an exact potential game, so iterated best response converges; it also collapses the learning problem to one threshold per node, which is what BETA's bandit arms represent.

What would settle it

Simulate two or more nodes on a collision channel where each node's value of information is a first-order autoregressive process rather than independent over time, then compare the average reward of the threshold policy from Eq. (9) with an optimal history-dependent policy obtained, for instance, by dynamic programming or a learned policy with memory. If the history-dependent policy achieves strictly higher average reward, the central myopic-threshold claim fails in the correlated regime. A second check: in an i.i.d. three-node setting with asymmetric distributions, use exhaustive search to ve

Watch

Extended reading notes

Core claim

The paper's central claim is that the joint problem of maximizing expected received value-of-information minus transmission cost over all nodes can be decoupled into independent threshold rules. Concretely, Theorem 2 states that for fixed strategies of the other nodes, node n's optimal transmission policy is to transmit only if its observed value v exceeds theta*_n = sum_{m≠n} sum_u u p_{m,u} x_{m,u}/(1−x̄_m) + ψ/ζ_n, where ψ is the transmission cost and ζ_n is the probability that all other nodes stay silent. Because the cooperative game is an exact potential game, iterating these best responses yields a local optimum, and the closed-form threshold makes each iteration cheap. The paper also

Load-bearing premise

Everything rests on the assumption that each node's value of information in a slot is statistically independent of earlier slots and of other nodes' values, so a node's best action depends only on the current slot's expected reward; if values are correlated over time, a myopic threshold need not be optimal.

Editorial extensions

If this is right

  • Distributed goal-oriented medium access can be solved by threshold rules computed per node, with no central scheduler deciding transmission order.
  • LIBRA provably reaches a local optimum (ε-Nash equilibrium) and, in the paper's simulations, beats the best single-dominant-node pull-based scheme by up to 100% in reward while cutting energy use by roughly 20–30%.
  • BETA reaches about 99% of LIBRA's reward using only limited feedback and no prior knowledge of the value-of-information distributions, converging in roughly 20 000 slots.
  • LIBRA remains within a few percent of its ideal performance even when nodes have imperfect estimates of other nodes' value distributions.
  • The threshold formulation applies to both discrete and continuous value domains, so the same protocol logic covers sensors reporting from finite alarm sets or from continuous measurement spaces.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Editorial inference: the threshold formula contains a natural 'load price' — the normalized expected value contributed by other nodes — which could be broadcast as a single scalar so nodes tune their thresholds without knowing each other's distributions; BETA's aggregate feedback is a step in this direction.
  • Editorial inference: under temporally correlated value of information (the paper's stated open problem), the memoryless threshold is unlikely to remain optimal; the testable conjecture is that optimal policies become state-dependent, for example thresholds that fall after missed transmissions.
  • Editorial inference: this result is the push-based mirror of index-based scheduling rules for age-of-information pull systems; showing that the threshold ordering coincides with the index ordering would unify the two approaches.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 5 minor

Summary. The paper formulates the Goal-oriented Multiple Access (GoMA) problem in a slotted collision channel with N sensor nodes. Each node observes a Value of Information (VoI) drawn from a known distribution (initially) and chooses a transmission probability for each possible VoI level. The main analytical results are: non-convexity of the resulting optimization problem (Lemma 1.1); a closed-form threshold characterization of each node's best response to the others' strategies (Theorem 2); an extension to continuous VoI domains (Theorem 3); and an iterated-best-response protocol, LIBRA, claimed to provably reach a Nash equilibrium. The paper then relaxes the distribution-knowledge assumption and proposes BETA, a distributed ε-Hedge algorithm with semi-bandit counterfactual estimation, claimed to converge quasi-exponentially to the LIBRA solution. Numerical experiments compare both protocols with a pull-based dominant-node scheduler and report gains in reward, energy consumption, and fairness. Reproducible simulation code is provided.

Significance. If the convergence claims are established, this is a valuable first theoretical treatment of distributed goal-oriented medium access. The threshold best-response theorem is clean, parameter-free, and self-contained; the non-convexity proof via Hessian minors is valid; and the paper gives a concrete algorithmic route from the centralized problem to a distributed, learning-based protocol. The empirical evaluation is extensive and the code availability is a strength. However, the theoretical convergence guarantee for BETA is not established under the nonstationary learning dynamics, and Theorem 1's proof relies on insufficiently justified imports. As written, the contribution is a strong problem formulation and a well-validated heuristic protocol rather than a fully proven theory of distributed GoMA learning. The paper is worth publishing after these load-bearing gaps are addressed.

major comments (2)
  1. [Section V-B, Theorem 4 and Section V-A] The BETA convergence claim is not supported. The proof of Theorem 4 ends with: 'All these estimates are unbiased and with finite variance, provided that the strategies of nodes are stable.' This is exactly the condition that fails during learning: in BETA the thresholds θ_n(i) are updated continuously, and the running averages ρ̄, ρ_n, α_n, β_n, λ_n accumulate samples collected under different strategy profiles. The imported quasi-exponential convergence result of [28], used in Section V-A, requires an unbiased finite-variance estimator at every learning round. Unbiasedness under stable strategies does not imply unbiasedness with respect to E[R(θ_n(i); θ_−n(i))] while θ changes; the sentence 'In any case, the semi-bandit feedback respects the conditions for quasi-exponential convergence' is an assertion, not a proof. The theorem as stated ('there exists a finite-variance, unbiased estima
  2. [Section III, Theorem 1] The proof of Theorem 1 is not sufficient as written. The game is a common-payoff game with continuous action spaces x_n ∈ [0,1]^{|V|}, so the cited finite best-response path result [23, Thm. 3] does not directly apply, and [24] concerns Markov potential games with independent natural policy gradient, not the static best-response dynamics considered here. The authors should give a direct proof for the finite set of threshold strategies, which is available from Theorem 2 (proved later), or otherwise justify the application of the cited results. Without this, the claim that IBR provably reaches an NE, or an ε-NE in polynomial time, is unsupported. This is load-bearing because LIBRA's optimality certificate rests on it.
minor comments (5)
  1. [Section III-B, Eq. (15)] The statement of Theorem 3 appears to have typos: the term ψ/θ_n should be ψ/ζ_n, and the integrand should use Q_m(p), not Q_n(p), consistently with Eq. (17) in the proof. Please correct the theorem statement to match the derivation.
  2. [Section III-A, proof of Theorem 2] There are small presentation issues: 'form which v ≥ θ∗_n' should be 'from which', and the expression E[R|θ∗_n, x_{n,θ∗_n}, x_−n] in Eq. (12) is not formatted clearly. Also, when ζ_n = 0 (some other node always transmits), the formula (9) is singular; the authors should explicitly state the trivial best response x_n = 0 in that case.
  3. [Section III-A, Lemma 1.1] In the Hessian minor argument, the 2×2 minor is taken with respect to variables (n,v) and (m,u). The text should state explicitly that n ≠ m, since the Hessian is hollow and the off-diagonal formula (6) has factor 1−δ_{m,n}.
  4. [Section V-B, Algorithm 2] The pseudocode layout of the Collision case is difficult to read, with formulas split across lines. The definitions of α_n, β_n, and λ_n should be stated clearly in the main text before Algorithm 2, and the window W used in the running averages should be integrated into the unbiasedness discussion.
  5. [Section IV-A] The phrase 'almost all initial point on the left-hand side' and a few other grammatical errors should be corrected. Also, Figure 2 would benefit from marking the axes more clearly when the initial threshold is a quantile versus a VoI value.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: threshold derivation is self-contained; BETA convergence gap is a proof-completeness issue, not circular reasoning.

full rationale

The derivation of the central threshold result (Theorem 2) is self-contained: for fixed x_{-n}, the objective (5) is affine in x_n, and the KKT stationarity condition (11) yields coefficient sign p_{n,v} ζ_n (v - θ*_n), so the optimal policy is bang-bang with the stated threshold (9). No parameter in (9) is fitted to the result it predicts, and the same holds for the continuous extension (Theorem 3). Corollary 2.1 and the IBR convergence claim rest on standard potential-game facts cited to [21,23,24] and on FBRP/ε-NE results [23,24]; these are external, not self-citations. The only self-citations (e.g., [19] in the introduction, [15] for push-based background) are contextual and not load-bearing. The one weak point is in Sec. V-B: the proof of Theorem 4 ends with "All these estimates are unbiased and with finite variance, provided that the strategies of nodes are stable. ... In any case, the semi-bandit feedback respects the conditions for quasi-exponential convergence." The stability condition is exactly what a learning algorithm violates, and the 'in any case' sentence is an unsupported assertion, so the quasi-exponential convergence guarantee imported from [28] is not fully established. This is a correctness/completeness gap, not a circularity: it does not reduce any conclusion to its own input, and the threshold theory is independent of it.

Assumptions & free parameters 0 free parameters · 6 assumptions · 0 invented entities

No fitted parameters appear in the central derivation; BETA hyperparameters (epsilon = 0.01, kappa) are within the ranges allowed by the convergence theorem and are not fitted to data. The main axiomatic load is the memoryless, independent VoI model and the ideal collision channel, both explicitly stated and partially acknowledged as limitations in Section VII.

assumptions (6)
  • domain assumption VoI values are independent across nodes and time slots
    Section II: 'We assume that the VoIs of the nodes are mutually independent'; the expected reward (5) is a per-slot expectation with no temporal coupling.
  • domain assumption Each node knows the VoI distributions of all other nodes, or can estimate them
    Section II: each node 'only knows the distribution pm of the VoI of any other node m'; this information structure is used in the IBR/LIBRA analysis and is relaxed only in BETA.
  • domain assumption Ideal time-slotted collision channel with no capture and no channel errors
    Section II: 'if multiple nodes transmit, all packets are erased'; the authors state the model can be extended, but the analysis depends on the simple collision form.
  • standard math Exact potential game plus finite best response path and polynomial convergence theorems
    Theorem 1 invokes Monderer and Shapley potential games, Milchtaich's FBRP, and a polynomial-time convergence result [24]; these external theorems are not re-proved in the paper.
  • standard math KKT conditions apply to the linear best-response problem and to the Hilbert-space extension
    Used in the proofs of Theorems 2 and 3; the paper cites standard results [25], [26], [27] for finite and infinite-dimensional convex optimization.
  • domain assumption Running-average statistics (rho, alpha, beta, lambda) are unbiased estimates of current transmission statistics
    Section V-B: 'All these estimates are unbiased and with finite variance, provided that the strategies of nodes are stable'; the algorithm uses these estimates during non-stationary learning, so this is an assumption.

how reviews work

0 comments
Cite this review

Pith. "Pith review of A Theory of Goal-Oriented Medium Access: Protocol Design and Distributed Bandit Learning." pith.science (2026). https://pith.science/paper/YDYP6BMG

@misc{pith2026250819141,
  author       = {Pith},
  title        = {Pith review of: A Theory of Goal-Oriented Medium Access: Protocol Design and Distributed Bandit Learning},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/YDYP6BMG}},
  note         = {Machine review of arXiv:2508.19141}
}
read the original abstract

The Goal-oriented Communication (GoC) paradigm breaks the separation between communication and the content of the data, tailoring communication decisions to the specific needs of the receiver and targeting application performance. While recent studies show impressive encoding performance in point-to-point scenarios, the multi-node distributed scenario is still almost unexplored. Moreover, the few studies to investigate this consider a centralized collision-free approach, where a central scheduler decides the transmission order of the nodes. In this work, we address the Goal-oriented Multiple Access (GoMA) problem, in which multiple intelligent agents must coordinate to share a wireless channel and avoid mutual interference. We propose a theoretical framework for the analysis and optimization of distributed GoMA, serving as a first step towards its complete characterization. We prove that the problem is non-convex and may admit multiple Nash Equilibrium (NE) solutions. We provide a characterization of each node's best response to others' strategies and propose an optimization approach that provably reaches one such NE, outperforming centralized approaches by up to 100% while also reducing energy consumption. We also design a distributed learning algorithm that operates with limited feedback and no prior knowledge.

Figures

Figures reproduced from arXiv: 2508.19141 by the authors.

Figure 1
Figure 1. Push- and pull-based communication performance under a binary [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Attraction regions of various NEs in a symmetric scenario with [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. LIBRA performance in the symmetric WSN scenario. [PITH_FULL_IMAGE:figures/full_fig_p008_3.png] view at source ↗
Figures from the paper (3 more)
Figure 4
Figure 4. Figure 4: LIBRA performance over 200 episodes in the asymmetric WSN scenario with N = 10 and ν = 0.5, relative to the push-based solution. The average gain for each setting is reported as a vertical dashed line with the same color. In all cases, the Monte Carlo results match our…
Figure 5
Figure 5. Figure 5: BETA performance over 100 runs in both scenarios with N = 10, ψ = 0.25. The shaded area represents the achievable convergence region. 1 1.1 1.2 1.3 0 0.2 0.4 0.6 0.8 1 η P(R ≤ ηRpull ) DNS LIBRA (ideal) LIBRA (shared) LIBRA (individual) [PITH_FULL_IMAGE:figures/full_f…
Figure 6
Figure 6. Figure 6: LIBRA robustness to parameter estimation errors over [PITH_FULL_IMAGE:figures/full_fig_p009_6.png]

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

31 extracted references · 28 canonical work pages

  1. [28]

    Learning with bandit feedback in potential games,

    J. Cohen, A. H ´eliou, and P. Mertikopoulos, “Learning with bandit feedback in potential games,” Proc. 31st Conference on Advances in Neural Information Processing Systems (NIPS), vol. 30, pp. 6372–6381, Dec. 2017

    work page 2017

  2. [24]

    Provably fast convergence of independent natural policy gradient for Markov potential games,

    Y . Sun, T. Liu, R. Zhou, P. Kumar, and S. Shahrampour, “Provably fast convergence of independent natural policy gradient for Markov potential games,” in Proc. 37th Conference on Neural Information Processing Systems (NeurIPS), vol. 36, Dec. 2023, pp. 43 951–43 971

    work page 2023

  3. [1]

    C. E. Shannon and W. Weaver, The mathematical theory of communi- cation. University of Illinois Press, Sep. 1949

    work page 1949

  4. [2]

    Beyond transmitting bits: Context, semantics, and task-oriented communications,

    D. G ¨und¨uz, Z. Qin, I. E. Aguerri, H. S. Dhillon, Z. Yang, A. Yener, K. K. Wong, and C.-B. Chae, “Beyond transmitting bits: Context, semantics, and task-oriented communications,” IEEE Journal on Selected Areas in Communications, vol. 41, no. 1, pp. 5–41, Jan. 2023

    work page 2023

  5. [3]

    Architecture, characteristics, and resource management of integration of sensing, communications, and computing in 6G,

    Y . Qi, Y . Zhou, Q. Cai, H. Zhang, Y . Xu, J. Shi, and S. Li, “Architecture, characteristics, and resource management of integration of sensing, communications, and computing in 6G,” IEEE Network, vol. 38, no. 2, pp. 54–61, Mar. 2024

    work page 2024

  6. [4]

    Deep joint source- channel coding for wireless image transmission,

    E. Bourtsoulatze, D. B. Kurka, and D. G ¨und¨uz, “Deep joint source- channel coding for wireless image transmission,” IEEE Transactions on Cognitive Communications and Networking , vol. 5, no. 3, pp. 567–579, Sep. 2019

    2019

  7. [5]

    A theory of semantic communication,

    Y . Shao, Q. Cao, and D. G¨und¨uz, “A theory of semantic communication,” IEEE Transactions on Mobile Computing , vol. 23, no. 12, pp. 12 211– 12 228, Dec. 2024

    work page 2024

  8. [6]

    Less data, more knowledge: Building next generation semantic communication networks,

    C. Chaccour, W. Saad, M. Debbah, Z. Han, and H. V . Poor, “Less data, more knowledge: Building next generation semantic communication networks,” IEEE Communications Surveys & Tutorials , vol. 27, no. 1, pp. 37–76, Feb. 2025

    work page 2025

Show all 31 references
  1. [7]

    Reinforcement learning over noisy channels: An information bottleneck approach,

    C. Kam, J. P. Macker, and Y . Sun, “Reinforcement learning over noisy channels: An information bottleneck approach,” in Proc. Military Communications Conference (MILCOM) . IEEE, Oct. 2024

    2024

  2. [8]

    Task- oriented co-design of communication, computing, and control for Edge- enabled industrial cyber-physical systems,

    Y . Diao, Y . Zhang, D. De Martini, P. G. Zhao, and E. L. Li, “Task- oriented co-design of communication, computing, and control for Edge- enabled industrial cyber-physical systems,” IEEE Journal on Selected Areas in Communications , May 2025, early Access

    2025

  3. [9]

    Pragmatic communication for remote control of finite- state Markov processes,

    P. Talli, E. D. Santi, F. Chiariotti, T. Soleymani, F. Mason, A. Zanella, and D. G ¨und¨uz, “Pragmatic communication for remote control of finite- state Markov processes,” IEEE Journal on Selected Areas in Communi- cations, vol. 43, no. 7, pp. 2589–2603, Jul. 2025

    2025

  4. [10]

    Semantic communication meets system 2 ML: How abstraction, compositionality and emergent languages shape intelligence,

    M. Bennis and S. Lahlou, “Semantic communication meets system 2 ML: How abstraction, compositionality and emergent languages shape intelligence,” arXiv preprint arXiv:2505.20964 , May 2025

    2025 arXiv

  5. [11]

    Optimal finite horizon scheduling of wireless networked control systems,

    O. Ayan, S. Hirche, A. Ephremides, and W. Kellerer, “Optimal finite horizon scheduling of wireless networked control systems,” IEEE/ACM Transactions on Networking , vol. 32, no. 2, pp. 927–942, Apr. 2024

    2024

  6. [12]

    Query-based sampling of heterogeneous CTMCs: Modeling and optimization with binary freshness,

    N. Akar and S. Ulukus, “Query-based sampling of heterogeneous CTMCs: Modeling and optimization with binary freshness,” IEEE Transactions on Communications, vol. 72, no. 12, pp. 7705–7714, Dec. 2024

    2024

  7. [13]

    A Whittle index approach to minimizing functions of age of information,

    V . Tripathi and E. Modiano, “A Whittle index approach to minimizing functions of age of information,” IEEE/ACM Transactions on Network- ing, vol. 32, no. 6, pp. 5144–5158, Dec. 2024

    2024

  8. [14]

    Coexistence of pull and push communication in wireless access for IoT devices,

    S. Cavallero, F. Saggese, J. Shiraishi, S. R. Pandey, C. Buratti, and P. Popovski, “Coexistence of pull and push communication in wireless access for IoT devices,” in Proc. 25th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) . IEEE, Sep...

    2024

  9. [15]

    Timely and massive communication in 6G: Pragmatics, learning, and inference,

    D. G ¨und¨uz, F. Chiariotti, K. Huang, A. E. Kalør, S. Kobus, and P. Popovski, “Timely and massive communication in 6G: Pragmatics, learning, and inference,” IEEE BITS the Information Theory Magazine , vol. 3, no. 1, pp. 27–40, Mar. 2023

    2023

  10. [16]

    Efficient LTE access with collision resolution for massive M2M communications,

    G. C. Madue ˜no, ˇC. Stefanovi ´c, and P. Popovski, “Efficient LTE access with collision resolution for massive M2M communications,” in Proc. IEEE GLOBECOM Workshops (GC Wkshps) , Dec. 2014, pp. 1433– 1438

    2014

  11. [17]

    Value-optimal priority- aware irregular repetition slotted ALOHA in satellite-integrated Internet of Things via noncooperative game,

    B. Zhang, Y . Zhang, Y . Wang, and Z. Yang, “Value-optimal priority- aware irregular repetition slotted ALOHA in satellite-integrated Internet of Things via noncooperative game,” IEEE Internet of Things Journal , vol. 11, no. 7, pp. 12 495–12 509, Apr. 2024

    2024

  12. [18]

    Goal-oriented multiple access connectivity for networked intelligent systems,

    P. Agheli, N. Pappas, and M. Kountouris, “Goal-oriented multiple access connectivity for networked intelligent systems,” IEEE Communications Letters, vol. 28, no. 8, pp. 1795–1799, Aug. 2024

    2024

  13. [19]

    Distributed opti- mization of age of incorrect information with dynamic epistemic logic,

    F. Chiariotti, A. Munari, L. Badia, and P. Popovski, “Distributed opti- mization of age of incorrect information with dynamic epistemic logic,” in Proc. Computer Communications Conference (INFOCOM) . IEEE, May 2025

    2025

  14. [20]

    Non-stochastic bandit slate problems,

    S. Kale, L. Reyzin, and R. E. Schapire, “Non-stochastic bandit slate problems,” Proc. 24th Conference on Advances in Neural Information Processing Systems (NIPS) , vol. 23, pp. 1054–1062, Dec. 2010

    2010

  15. [21]

    Potential games,

    D. Monderer and L. S. Shapley, “Potential games,” Games and Economic Behavior, vol. 14, no. 1, pp. 124–143, May 1996

    1996

  16. [22]

    The evolution of conventions,

    H. P. Young, “The evolution of conventions,” Econometrica: Journal of the Econometric Society , vol. 61, no. 1, pp. 57–84, Jan. 1993

    1993

  17. [23]

    Congestion games with player-specific payoff functions,

    I. Milchtaich, “Congestion games with player-specific payoff functions,” Games and Economic Behavior, vol. 13, no. 1, pp. 111–124, Mar. 1996

    1996

  18. [25]

    Nonlinear programming,

    H. W. Kuhn and A. W. Tucker, “Nonlinear programming,” in Proc. 2nd Berkeley Symposium on Mathematical Statistics and Probability , Aug. 1950, pp. 481–492

    1950

  19. [26]

    Convex programming in Hilbert space,

    A. Goldstein, “Convex programming in Hilbert space,” Bulletin of the American Mathematical Society, vol. 70, no. 6, pp. 709–710, May 1964

    1964

  20. [27]

    The Kuhn-Tucker conditions in Banach space with an application to control theory,

    D. L. Russell, “The Kuhn-Tucker conditions in Banach space with an application to control theory,” Journal of Mathematical Analysis and Applications, vol. 15, no. 2, pp. 200–212, Aug. 1966

    1966

  21. [29]

    A decision-theoretic generalization of on-line learning and an application to boosting,

    Y . Freund and R. E. Schapire, “A decision-theoretic generalization of on-line learning and an application to boosting,” Journal of Computer and System Sciences , vol. 55, no. 1, pp. 119–139, Aug. 1997

    1997

  22. [30]

    A new approach to linear filtering and prediction problems,

    R. E. Kalman, “A new approach to linear filtering and prediction problems,” Journal of Basic Engineering , vol. 82, no. 1, pp. 35–45, Mar. 1960

    1960

  23. [31]

    R. L. Stratonovich, “ Оптимальные нелинейные системы, осу- ществляющие выделение сигнала с постоянными парамет- рами из шума (Optimum nonlinear systems which bring about a separation of a signal with constant parameters from noise),”Radiofizika, vol. 2, no. 6, pp. 892–901, Dec. 1959

    1959

Pith tools

Reviewed August 5, 2026 · model on record in the stance chip above.