Skip to main content
Search

University of Alberta

15 related articles

Subscribe to updates
  1. arXiv

    Putting an Ising model inside a hidden Markov chain: pseudolikelihood sidesteps the partition function, and U.S. county gun-death weeks split into four states

    The hidden Markov Ising model makes an Ising model, a binary graphical model from statistical physics, the emission distribution of a hidden Markov chain, so that a binary network's dependence structure is modeled directly as its state changes over time. Because the Ising normalizing constant grows exponentially with the number of nodes, fitting uses pseudolikelihood inside Baum-Welch reestimation, with results on the algorithm's validity, model identifiability and large-network consistency. Exogenous covariates extend it to a hidden Markov autologistic model, applied to a five-year sequence of weekly gun-death events across 3109 continental U.S. counties from 2021 to 2025, where it identifies state changes in gun violence activity.

  2. arXiv

    A PMSM digital twin that relearns its own step: FPGA runs the network, and a shifted machine is re-approached in 94 seconds

    Real-time digital twins of permanent magnet synchronous machines have relied on offline-identified parameters or finite-element flux look-up tables, which must be regenerated when the machine changes. The Inferencer-in-the-Loop architecture has a field-programmable gate array execute a physics-guided network while a GPU retrains it from reference data, switching weights only after validation. Across damper circuits, shifted parameters and an FEA-calibrated saturated machine, one kernel form reaches average normalized mean absolute errors of 0.19%–0.67% at measured kernel latencies of 0.30–0.34 microseconds; on a 200-W drive, a residual form gives errors of 5.9%–9.4% of measured RMS over six held-out runs.

  3. arXiv

    RucTangle splits coding-agent patches into commit histories that stay runnable at every commit and lifts pass@1 by 16.6% on average in regression repair

    The work introduces RucTangle, an agentic commit-untangling method that groups a patch's changes by development purpose, orders them, applies each commit and checks whether the code still runs, revising order first, then regrouping via the agent, and finally merging adjacent commits while preserving the patch's final code; on 131 agent-generated patches it is the only method that reconstructs every patch with all commits runnable, at a median of eight commits, whereas baselines leave 20.6%–37.4% of histories with at least one unrunnable version. The authors also present TangleEval, which has two coding agents repair 453 regression-introducing patches; adding RucTangle histories plus git bisect results raises pass@1 from 26.9% to 31.3% and from 30.8% to 36.0%.

  4. arXiv

    Bather-Decomposition-Driven Average-Reward RL for Multichain MDPs: Three Algorithms with Almost-Sure Convergence and Improved Transient Performance

    This work proposes three asynchronous value-iteration-based reinforcement learning algorithms for average-reward multichain MDPs: a base algorithm uses Bather's unique hierarchical decomposition to partition the state space into communicating subsystems and transient states, estimates each subsystem's gain via RVI Q-learning, and solves an aggregated optimal stopping problem via Q-learning, converging almost surely to the optimal gain and producing gain-optimal policies after finite time; two further algorithms approximately solve the average optimality equations for near gain-optimal policies and approximate the optimal bias function for near bias-optimal policies, with experiments showing the latter two improve transient performance while remaining near gain-optimal.

  5. arXiv

    Wayfarer discovers options online via Laplacian representation learning, reaching state-of-the-art single-stream performance on Atari 2600 games such as Montezuma's Revenge

    The work presents Wayfarer, a general, domain-agnostic, online deep RL agent that discovers options through Laplacian representation learning from high-dimensional observations and leverages them for control; the authors report that the resulting options simultaneously improve exploration, accelerate credit assignment, and generalise effectively to unseen settings, enabling substantially faster learning of complex policies and achieving state-of-the-art performance among single-stream agents on the most challenging Atari 2600 games, with the largest gains in games requiring long-horizon exploration and strategic behaviour, such as Montezuma's Revenge and Private Eye.

  6. After reviewing 922 citations, 41 international experts extended the acute exacerbation definition from IPF to all fibrotic interstitial lung diseases and proposed a new acute respiratory worsening framework

    An international multidisciplinary working group of 41 experts systematically reviewed 922 citations up to March 17, 2025, revised the 2016 acute exacerbation (AE) definition—previously limited to idiopathic pulmonary fibrosis (IPF)—into an AE-fILD definition applicable across all fibrotic interstitial lung diseases (anchored in diffuse alveolar damage with or without organizing pneumonia), proposed the broader concept of acute respiratory worsening (ARW) to capture acute deteriorations not attributable to DAD, and summarized evidence on epidemiology, risk factors, prognosis, and management while discussing AE as a clinical trial endpoint.

  7. arXiv

    Across nearly half a million names and 12 tokenizers, whether a name becomes a single token shifts concept accessibility in fellowship, hiring, clinical, and lending judgments

    The study introduces NameTrace, measures direct lexical support for names across nearly half a million first names and 12 LLM-associated tokenizers, and, on atomic versus short-fragmented names matched within the same race/ethnicity–gender strata, finds systematically higher task-aligned concept accessibility for atomic names across fellowship, hiring, clinical assessment, and lending; the differences persist in all eight strata, transfer to unseen names, and hidden-state interventions along the measured task directions shift later constrained choices.

  8. arXiv

    Auditing 1,813 AmE–BrE variant pairs across the pipeline: six pretraining corpora, 21 post-training datasets and ten checkpoints all lean American English

    The study builds a curated resource of 1,813 matched American English–British English variant pairs and introduces DiAlign, a training-free method for estimating regional alignment, then uses them to audit six pretraining corpora, 21 post-training datasets, nine tokenizers, ten model checkpoints and generations under two prompting conditions, finding that American English is systematically favored across data exposure, representation and generation, and that British-English prompting only partially shifts this default.

  9. arXiv

    BrainSTR models dynamic brain networks with spatio-temporal contrastive learning, validated on ASD, BD, and MDD with critical phases and subnetworks consistent with prior neuroimaging findings

    The work proposes BrainSTR, a spatio-temporal contrastive learning framework that learns state-consistent phase boundaries via a data-driven Adaptive Phase Partition module, identifies diagnostically critical phases with attention, and extracts disease-related connectivity within each phase using an Incremental Graph Structure Generator regularized by binarization, temporal smoothness, and sparsity; a spatio-temporal supervised contrastive learning approach then leverages diagnosis-relevant spatio-temporal patterns to refine the similarity metric between samples and build a well-structured semantic space. Experiments on ASD, BD, and MDD validate its effectiveness, and the discovered critical phases and subnetworks provide interpretable evidence consistent with prior neuroimaging findings.

  10. arXiv

    BrainHO replaces fixed brain atlases with learnable subgraphs, reaching 69.68% accuracy on ABIDE from PCC input alone while localizing cross-network disease subgraphs

    The work proposes Brain Hierarchical Organization Learning (BrainHO), which uses learnable subgraph and graph tokens to aggregate brain regions bottom-up via hierarchical attention driven by node feature affinity, combined with a subgraph orthogonality constraint and a hierarchical consistency constraint; on ABIDE (N=1009, 516 ASD/493 healthy controls) and REST-meta-MDD (N=2380, 1276 MDD/1104 healthy controls) it attains the highest accuracy (69.68% and 64.71%) and sensitivity (73.11% and 67.43%) using only the static PCC connectivity matrix, while visualizing disease-related subgraphs that partly overlap predefined networks such as the SMN and DAN and partly span multiple predefined networks.