Close Menu
techwavedispatch.com

    Subscribe to Updates

    Get the latest creative news from FooBar about art, design and business.

    What's Hot

    [2611.25796] How Reliable Are Explanations of Language Models That Detect Insider Threats?

    November 21, 2026

    Lifting Classifier Training with Latent Gaussian Mixture Models

    November 21, 2026

    New open model Inkling 2 Mini thinks in loops to solve problems with fewer words and still runs on a laptop

    November 21, 2026
    Facebook X (Twitter) Instagram
    Trending
    • [2611.25796] How Reliable Are Explanations of Language Models That Detect Insider Threats?
    • Lifting Classifier Training with Latent Gaussian Mixture Models
    • New open model Inkling 2 Mini thinks in loops to solve problems with fewer words and still runs on a laptop
    • RouteVerify: Routing Interventions for Step-Level Verification in Mixture-of-Experts Models
    • US technology stocks suffer their worst weekly loss since the pandemic as AI doubts pile up
    • [2609.04910] Fast Gauss Sums via Flash Attention
    • 17 Best Gifts for Women in the Enshittocene (2026)
    • Disentangling Monitor Hardware Artifacts and Smoothing Lag for Shift-Robust Intraoperative EEG and Hemodynamic Risk Calibration
    Facebook X (Twitter) Instagram
    techwavedispatch.com
    Subscribe
    Saturday, November 21
    • Home
    • AI Tools & Software
    • Machine Learning
    • Generative AI
    • Robotics & Automation
    • Future Tech & Hardware
    • AI in Business
    • Ethics & Regulations
    • More
      • Gadgets & Smart Devices
      • Cybersecurity & AI
      • Tech Breakthroughs
    techwavedispatch.com
    Home»Machine Learning»[2604.15285] Structural interpretability in SVMs with truncated orthogonal polynomial kernels
    Machine Learning

    [2604.15285] Structural interpretability in SVMs with truncated orthogonal polynomial kernels

    adminBy adminNovember 17, 2026No Comments2 Mins Read
    Facebook Twitter Pinterest LinkedIn Tumblr Email
    [2604.15285] Structural interpretability in SVMs with truncated orthogonal polynomial kernels
    Share
    Facebook Twitter LinkedIn Pinterest Email

    [Submitted on 16 Apr 2026 (v1), last revised 15 Nov 2026 (this version, v2)]

    View a PDF of the paper titled Structural interpretability in SVMs with truncated orthogonal polynomial kernels, by V\’ictor Soto-Larrosa and Nuria Torrado and Edmundo J. Huertas

    View PDF
    HTML (experimental)

    Abstract:Support vector machines (SVMs) can yield classifiers with similar predictive performance but different internal structures, particularly in the contributions of individual explanatory variables and their interactions. We introduce Orthogonal Representation Contribution Analysis (ORCA), a post-training methodology for SVMs constructed from tensor products of truncated Christoffel–Darboux kernels. The associated reproducing kernel Hilbert space (RKHS) admits a finite orthonormal polynomial basis in which the regularized component of the fitted decision function has an exact expansion. Squared expansion coefficients induce an additive decomposition of its squared RKHS norm. Based on this representation, normalized Orthogonal Kernel Contribution (OKC) indices quantify the fractions of the squared RKHS norm associated with total polynomial degrees, interaction orders, and input-variable contributions, both individually and through interactions of arbitrary order. ORCA summarizes these indices through joint structural maps, variable-specific displays, and comparisons of fitted classifiers. A controlled quartet of classification problems illustrates substantial structural differences under matched predictive performance. A double-spiral experiment compares five Jacobi kernels, while an application to the Vertebral Column data illustrates the method after cross-validated model selection. ORCA provides a quantitative characterization of the internal structure of fitted SVMs, revealing differences that may remain undetected by standard predictive performance metrics.

    Submission history

    From: Nuria Torrado [view email]
    [v1]
    Thu, 16 Apr 2026 17:52:08 UTC (1,694 KB)
    [v2]
    Sun, 15 Nov 2026 12:22:41 UTC (6,192 KB)

    Interpretability Kernels Orthogonal polynomial Structural SVMs truncated
    Share. Facebook Twitter Pinterest LinkedIn Tumblr Email
    admin
    • Website

    Related Posts

    [2611.25796] How Reliable Are Explanations of Language Models That Detect Insider Threats?

    November 21, 2026

    Lifting Classifier Training with Latent Gaussian Mixture Models

    November 21, 2026

    RouteVerify: Routing Interventions for Step-Level Verification in Mixture-of-Experts Models

    November 21, 2026
    Leave A Reply Cancel Reply

    Top Posts

    NVIDIA Is Investigating Reports That CEO Jensen Huang Was The Target Of Chinese Spy Efforts

    November 8, 202619 Views

    ADIndex: Layer-Adaptive Sparse Attention Indexing via Group-Level Distillation

    November 11, 20265 Views

    Anthropic releases new Mythos and Fable models amid RSI concerns

    November 9, 20265 Views

    If AGI is so close, why is everyone leaving? The neolabs and their bets

    November 6, 20265 Views
    Don't Miss
    Machine Learning

    [2611.25796] How Reliable Are Explanations of Language Models That Detect Insider Threats?

    By adminNovember 21, 20260

    arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly…

    Lifting Classifier Training with Latent Gaussian Mixture Models

    November 21, 2026

    New open model Inkling 2 Mini thinks in loops to solve problems with fewer words and still runs on a laptop

    November 21, 2026

    RouteVerify: Routing Interventions for Step-Level Verification in Mixture-of-Experts Models

    November 21, 2026
    About Us

    Welcome to TechWave Dispatch

    At TechWave Dispatch, we bring you the latest news, insights, and developments from the ever-evolving world of technology. Our mission is to keep readers informed about the innovations shaping our digital future.

    From artificial intelligence and machine learning to cybersecurity, robotics, smart devices, and groundbreaking technologies, we cover the topics that matter in today's fast-moving tech landscape.

    Our Picks

    [2611.25796] How Reliable Are Explanations of Language Models That Detect Insider Threats?

    November 21, 2026

    Lifting Classifier Training with Latent Gaussian Mixture Models

    November 21, 2026

    New open model Inkling 2 Mini thinks in loops to solve problems with fewer words and still runs on a laptop

    November 21, 2026
    Most Popular

    After blocking Muse, Amazon now lets users text Alexa to help them shop

    November 6, 20260 Views

    A controlled world for robot learning and evaluation

    November 6, 20260 Views

    Egyptian and Nigerian English join the Open ASR Leaderboard

    November 6, 20260 Views
    Facebook X (Twitter) Instagram Pinterest
    • Terms and Conditions
    • Privacy Policy
    • Contact Us
    • About Us
    © 2026 TechWave Dispatch. All Rights Reserved.

    Type above and press Enter to search. Press Esc to cancel.