New framework for designing cognitive experiments to infer latent cognitive mechanisms.
problem Designing optimal cognitive experiments for Bayesian inference of latent cognitive mechanisms.
method Formulated as a Bayesian Experimental Design (BED) problem, treating environments as design variables. Introduced an amortized Bayesian experimental design framework for efficient posterior inference and design evaluation.
result No single environment is uniformly optimal for all cognitive inference objectives, revealing trade-offs between expected information gain, posterior recoverability, and information efficiency.
New framework for designing cognitive experiments to infer latent cognitive mechanisms.
problem Designing cognitive experiments to infer latent cognitive mechanisms.
method Formulated as a Bayesian Experimental Design (BED) problem, treating the experimental environment as the design variable. Introduced an amortized Bayesian experimental design framework for efficient posterior inference and design evaluation.
result No single environment is uniformly optimal across cognitive inference objectives, revealing trade-offs between expected information gain, posterior recoverability, and information efficiency.
Paper presents a new method to detect process differences at the trace level using mutual fingerprints.
problem Low-level granularity in process variant analysis leads to many false differences.
method Develops a mutual fingerprint technique to encode entire process traces for comparison.
result Mutual fingerprint method reveals significant differences not detected by existing techniques.
The paper proposes new interpretability paradigms to improve model faithfulness.
problem Improving the accuracy of explanations for complex models.
method Examining and evolving existing paradigms, proposing new models.
result Three new paradigms for interpretability are presented.
Paper explores limits of distributed dislocations in geometric and constitutive paradigms.
problem Understanding limits of distributed dislocations in geometric and constitutive paradigms.
method Review and comparison of geometric and constitutive paradigms, analysis of edge dislocations in both paradigms.
result Homogenization theories in geometric and constitutive paradigms are consistent and identical in the case of constitutive relations having discrete symmetries.
This review explores resampling techniques for imbalanced binary classification.
problem Imbalanced classes lead to poor prediction results in classification.
method Classical, cost-sensitive, and Neyman-Pearson paradigms with resampling techniques and classification methods.
result Complex dynamics among resampling techniques, base methods, metrics, and imbalance ratios.
Combines cost-sensitive and Neyman-Pearson paradigms for better binary classification.
problem Asymmetric binary classification problems with unequal error severities.
method Develops TUBE-CS algorithm to bridge cost-sensitive and Neyman-Pearson paradigms.
result High-probability control of population type I error.
We present two paradigms relating algebraic, topological and quantum computational statistics for the topological model for quantum computation. In particular we suggest correspondences between the computational power of topological quantum computers, computational complexity of link invariants and images of braid grou…
A new learning paradigm enhances RVFL networks with better generalization.
problem Improving the generalization performance of RVFL networks.
method Integrates LUPI paradigm into RVFL networks, introduces KRVFL+.
result Proposed RVFL+ achieves better generalization performance than state-of-the-art methods.
Paper proposes SPO paradigm for better portfolio optimization in real markets.
problem Real-world trading frictions and constraints affect portfolio optimization quality.
method SPO paradigm with decision-focused training using surrogate loss and linear predictors.
result Decision-focused training improves risk-adjusted performance and robustness.
This work tackles missing annotations in large sensor datasets.
problem Missing annotations in large sensor datasets negatively affect supervised learning system performance.
method Proposes and evaluates three paradigms to handle gaps: dropping, single label, and unique label, along with a hybrid combination.
result Evaluation of proposed paradigms and hybrid combination shows significant performance improvement.
In this paper, simple mathematical models from Control Theory are applied to three very important economic paradigms, namely (a) minimum wages in self-regulating markets, (b) market-versus-true values and currency rates, and (c) government spending and taxation levels. Analytical solutions are provided in all three par…
This research compares masked diffusion models to autoregressive language models, focusing on architectural differences.
problem Comparing masked diffusion models to autoregressive language models due to architectural differences.
method Equitably compare MDMs within a decoder-only framework, investigating architectural influences.
result Decoder-only MDMs can achieve significant speedups and comparable perplexity with temperature annealing.
Paper classifies institutions based on credit, debit, and funding adjustment paradigms.
problem Classifying institutions based on credit, debit, and funding adjustment paradigms.
method Mathematical framework based on the principle of invariance.
result Improved solution of principle of invariance equations for accurate metrics calculation.
Brain computer interfaces (BCI) enable direct communication with a computer, using neural activity as the control signal. This neural signal is generally chosen from a variety of well-studied electroencephalogram (EEG) signals. For a given BCI paradigm, feature extractors and classifiers are tailored to the distinct ch…
MapLUR uses deep learning on map images to estimate NO2 pollution, outperforming traditional methods.
problem Limited availability of data for traditional LUR models makes them hard to adapt to new areas.
method Data-driven, open-source approach using convolutional neural networks trained on map data.
result MapLUR significantly outperforms traditional LUR models, including those with manually engineered features.
MARGINATTACK improves zero-confidence adversarial attacks' accuracy and efficiency.
problem Improving zero-confidence adversarial attacks' accuracy and efficiency.
method Proposes MARGINATTACK, a zero-confidence attack framework that computes margin with improved accuracy and efficiency.
result MARGINATTACK computes a smaller margin than state-of-the-art zero-confidence attacks and matches state-of-the-art fix-perturbation attacks.
Data science models, although successful in a number of commercial domains, have had limited applicability in scientific problems involving complex physical phenomena. Theory-guided data science (TGDS) is an emerging paradigm that aims to leverage the wealth of scientific knowledge for improving the effectiveness of da…
Blockchain as a Service offers a secure, decentralized computing solution.
problem Lack of transparency, security, and privacy in cloud computing.
method Decentralized cooperative computing process using blockchain, homomorphic encryption, and SDN.
result Performance evaluated via different scenarios in simulations.
Adjoined Networks trains both base and compressed networks together for efficient model compression.
problem Efficiently compressing deep neural networks while maintaining accuracy.
method Adjoined Networks (AN) trains both a base network and a smaller compressed network simultaneously, sharing parameters.
result AN achieves 71.8% top-1 accuracy with 1.8M parameters and 1.6 GFLOPs on ImageNet.
Enhances data programming with continuous labeling functions for better model performance.
problem Scarcity of labeled data hampers supervised learning models.
method Integrates continuous scoring functions and quality guides into a generative model to improve data programming reliability.
result Continuous labeling functions lead to improved recall and more stable model performance.
New approach to counterfactual reasoning avoids demographic interventions.
problem Limitations of traditional counterfactual reasoning in AI systems.
method Backtracking counterfactual approach instead of interventional.
result Allows addressing social concerns without demographic interventions.
Graph Polish optimizes molecular structures by minimizing changes and maximizing preservation.
problem Error-prone traditional molecular optimization methods.
method Graph Polish transforms optimization into a polishing task, focusing on optimization centers and minimizing changes.
result Significant advantage over state-of-the-art methods on multiple optimization tasks.
Proposes a method to adapt to new classes in a domain shift.
problem Learning new classes in a domain shift without labeled supervision.
method Inspired by prototypical networks, the method classifies target samples into shared and novel classes.
result Superior performance compared to DA and CI methods in the CIDA paradigm.
This research formalizes inductive generalization and proposes a new learning paradigm called Inductive Learning.
problem Generalization from easy to hard tasks, especially out-of-domain generalization.
method Formalizes inductive generalization, introduces Inductive Learning, and outlines steps to adapt techniques for learning model successors.
result A new learning paradigm (Inductive Learning) that emphasizes induction and universal properties of learning and computation.
A new method combines spectral and density-based clustering for robust nonconvex clustering.
problem Finding robust clusterings for nonconvex shapes with varying densities and noise.
method Combining spectral and density-based clustering approaches to optimize a density criterion.
result Our method provides robust and reliable clusterings on synthetic and real-world data.
We present a new paradigm for speeding up randomized computations of several frequently used functions in machine learning. In particular, our paradigm can be applied for improving computations of kernels based on random embeddings. Above that, the presented framework covers multivariate randomized functions. As a bypr…
Combines k-NN and RVM for improved classification accuracy.
problem Improving k-NN's performance by considering relevancy.
method Integrates k-NN and RVM in kernel space, introduces a new stopping parameter.
result Significantly prunes irrelevant attributes and improves classification accuracy.
Paper adapts Bayesian Hui-Walter method for unlabeled data.
problem Lack of labeled data in machine learning.
method Adapted Hui-Walter paradigm for online, unlabeled data.
result Estimates performance metrics without labeled data.
Proposes a new stock prediction method that accounts for market dynamics.
problem The dynamic nature of the stock market invalidates traditional machine learning assumptions.
method Develops a second-order learning paradigm with multi-scale patterns.
result Demonstrates effectiveness in stock prediction on real-world data.
Federated Collaborative Filtering preserves user privacy in recommendation systems.
problem Preserving user privacy in machine learning models.
method Federated Learning approach with stochastic gradient updates.
result Collaborative filtering can be successfully federated without accuracy loss.
PFOPS extends PFO to multi-objective optimization.
problem Current PFO algorithms only handle single-objective optimization; real problems often require multiple objectives.
method PFOPS uses path sampling to balance multiple objectives within the PFO framework.
result PFOPS successfully handles convex, concave, and discontinuous Pareto fronts in MOO experiments.
Since its inception, the modus operandi of multi-task learning (MTL) has been to minimize the task-wise mean of the empirical risks. We introduce a generalized loss-compositional paradigm for MTL that includes a spectrum of formulations as a subfamily. One endpoint of this spectrum is minimax MTL: a new MTL formulation…
Develops algorithms for multi-class Neyman-Pearson classification with cost sensitivity.
problem Asymmetric misclassification costs in multi-class classification problems.
method Establishes connection with cost-sensitive learning, proposes two algorithms, extends NP oracle properties.
result Proposes algorithms with theoretical guarantees for multi-class Neyman-Pearson classification.
New algorithm reduces individual regret and communication costs in cooperative bandits.
problem Optimal individual and group regret in cooperative multi-agent bandits.
method Integrates a new communication policy into a learning algorithm.
result Achieves optimal individual regret and constant communication costs.
New trading model uses self-organization for real-world complexity.
problem Traditional trading models are too analytical for real-world conditions.
method Embraces self-organization, complex systems theory, and event-based time.
result Example Delta Engine algorithm demonstrates effectiveness.
Paper proposes verifier engineering for improving foundation models.
problem Challenges in providing effective supervision signals for foundation models.
method Leverages automated verifiers to perform verification tasks and deliver feedback.
result Verifier engineering can enhance foundation models' capabilities.
Neuromorphic column performs online unsupervised clustering.
problem Real-time clustering of streaming data.
method Localized, spike timing-dependent plasticity (STDP) neural column.
result Prototype column performs similarly to k-means clustering.
Most existing binary classification methods target on the optimization of the overall classification risk and may fail to serve some real-world applications such as cancer diagnosis, where users are more concerned with the risk of misclassifying one specific class than the other. Neyman-Pearson (NP) paradigm was introd…
New method improves language model fine-tuning without forgetting.
problem Fine-tuning language models to match specific distributions without forgetting.
method Combines Distribution Matching and Reinforcement Learning techniques.
result Adding a baseline improves constraint satisfaction, stability, and efficiency.
The paper classifies various higher moments portfolio optimization methods.
problem Optimizing portfolios with higher moments like skewness and kurtosis.
method Review of different optimization paradigms including utility and multi-objective approaches.
result Comparison of advantages and disadvantages of various methods.
Crowdsourced wisdom improves causal learning.
problem Improving causal learning through collective intelligence.
method Crowdsourcing, expert knowledge elicitation, aggregation techniques, and LLMs.
result Collective contributions enhance global causal structure.
Study on teaching reinforcement learning with Q-learning, reducing sample complexity.
problem Reducing sample complexity in reinforcement learning.
method Characterized teaching dimension for Q-learning under different teacher control, presented optimal teaching algorithms.
result Minimum number of samples needed for reinforcement learning is characterized.
Optimizes quantile and semi-adversarial regret with novel root-logarithmic regularizers.
problem Minimizes regret in adversarial and semi-adversarial online learning.
method FTRL with root-logarithmic regularizers for quantile and semi-adversarial settings.
result Achieves minimax optimal regret bounds in both paradigms.
KFServing simplifies serverless machine learning model deployment.
problem Autoscaling and cost management for machine learning models.
method KFServing project on KNative serverless platform.
result Consistent and simple interface for data scientists to deploy models.
Paper uses SVM+ for valid prediction intervals in drug discovery datasets.
problem Valid prediction intervals in drug discovery datasets.
method LUPI paradigm, SVM+, inductive conformal predictor.
result Valid prediction intervals at specified significance levels.
We propose a paradigm to deep-learn the ever-expanding databases which have emerged in mathematical physics and particle phenomenology, as diverse as the statistics of string vacua or combinatorial and algebraic geometry. As concrete examples, we establish multi-layer neural networks as both classifiers and predictors …
Study compares RL and SL for TSP, finds RL better for variable graph sizes.
problem Training deep neural networks for the Travelling Salesman Problem.
method Controlled experiments with supervised and reinforcement learning models on fixed and variable sized graphs.
result Reinforcement learning leads to better generalization to variable graph sizes.