Agents learn state without recalling private signals in networks.
problem Agents learn unknown state from private signals in networks.
method Memoryless update rules that replicate Bayesian agents' beliefs.
result Exponential learning rate similar to Bayesian agents.
Conservation laws improve diffusion model training by optimizing likelihood.
problem Training diffusion models with denoising objectives.
method Developed conservation laws based on GEXIT functions for memoryless noise processes.
result Unified characterization of diffusion model likelihood, reducing training to learning marginal posteriors.
New method improves evaluation of new policies in reinforcement learning.
problem Efficient off-policy evaluation in Markov decision processes.
method Double Reinforcement Learning (DRL) estimator for q-functions and marginalized density ratios. result DRL is efficient and doubly robust under certain conditions.
New RL algorithm for POMDPs using spectral methods.
problem Learning POMDPs where the learner interacts and potentially changes future observations.
method Spectral decomposition techniques applied through episodes, optimizing memoryless policies.
result Order-optimal regret bound with efficient scaling.
Adjoint Matching improves flow and diffusion models with reward fine-tuning.
problem Improving generative models with reward fine-tuning.
method Casting reward fine-tuning as stochastic optimal control (SOC) and enforcing a specific noise schedule.
result Adjoint Matching outperforms existing SOC algorithms.
New method evaluates LLMs fairness in universal prediction.
problem Evaluating fairness of large language models in universal prediction.
method Introducing batch regret as a modification of average regret for LLMs.
result Asymptotical value of batch regret for add-constant predictors on memoryless and first-order Markov sources.
The paper derives a new theorem for predicting batches of data.
problem Finding lower bounds on minimal batch regret.
method Derives a conditional version of the regret-capacity theorem.
result Reveals a connection between conditional Rényi divergence and conditional Sibson's mutual information.
A new hierarchy quantifies agency in systems based on information processing.
problem Lack of a measurable, universal definition for agency in intelligent systems.
method Developed a bottom-up framework based on information processing hierarchy.
result Identified three orders of information processing (I, II, III) as necessary for agency.
BestChanID identifies the channel with maximal capacity using training sequences.
problem Identifying the channel with maximal capacity among several discrete memoryless channels.
method Formulated as a multi-armed bandit problem, proposed a capacity estimator, and developed gap-elimination algorithms.
result Guaranteed to output the DMC with the largest capacity with a desired confidence.
New RL algorithm for POMDPs using spectral methods.
problem Learning POMDPs where interactions change future observations.
method Epoch-based spectral decomposition for parameter learning, followed by optimal policy optimization.
result Order-optimal regret bound with efficient scaling.
dtControl uses decision trees to represent controllers efficiently and explainably.
problem Representing controllers concisely and explainably.
method dtControl uses decision tree learning algorithms to represent controllers. Novel techniques for determinizing controllers are introduced.
result Novel techniques for determinizing controllers during decision tree construction are extremely efficient, yielding small decision trees.
A method to learn distributed representations from multiple sources of information.
problem Learning representations from multiple, separate sources of information.
method Generalization of Tishby's IB method to the distributed setting, using variational bounds and iterative algorithms.
result Explicit characterizations of optimal tradeoffs between complexity and relevance for discrete and Gaussian models.
Study language generation with limited memory, showing different impacts on achievable densities and convergence.
problem Language generation with bounded memory constraints.
method Analyzed memoryless generators, sliding windows, and adaptive past examples; revisited identification in the limit.
result Achievable densities and convergence properties differ based on the size of the target language collection.
A technique identifies memoryless algorithms approximating memory-dependent optimization methods.
problem Understanding how memory in optimization algorithms affects loss and generalization.
method Introducing a general technique to replace past iterates with the current one and adding a correction term.
result Lion does not have the same implicit anti-regularization as AdamW, explaining its better generalization performance.
Gradient descent and Adam differ in their treatment of low-rank solutions due to loss symmetry.
problem Understanding why gradient descent and Adam yield different low-rank solutions.
method Analyzing the gauge symmetry of the loss function and the equivariance of optimization algorithms.
result Adam does not suffer from the same low-rank bias as gradient descent due to its structure.
In the Bayesian approach to sequential decision making, exact calculation of the (subjective) utility is intractable. This extends to most special cases of interest, such as reinforcement learning problems. While utility bounds are known to exist for this problem, so far none of them were particularly tight. In this pa…
Unified framework for blending ML and mechanistic models in dynamical systems.
problem Learning dynamical systems from noisy, partially observed data.
method A unifying framework that combines mechanistic and machine learning approaches.
result Proves that hybrid models can learn memory-dependent model error.
Market activity scales near a constant of 0.632 in intrinsic time.
problem Understanding the stability of market scaling laws.
method Modeling market directional changes as a memoryless exponential hazard process and identifying the intrinsic time scaling constant.
result The intrinsic time scaling constant is 1−1/e=0.632. Optimizer memory affects learning rate sensitivity in shuffle order, impacting fine-tuning noise.
problem Optimizer memory affects the learning rate sensitivity in shuffle order, leading to fine-tuning noise.
method Isolated the mechanism of fixed-clock optimizer memory affecting the learning rate sensitivity in shuffle order, deriving a fit-free way to size the noise.
result Fixed-clock optimizers like AdamW produce a larger first-order noise channel compared to memoryless optimizers, affecting fine-tuning comparisons.
We review the decomposition method of stock return cross-correlations, presented previously for studying the dependence of the correlation coefficient on the resolution of data (Epps effect). Through a toy model of random walk/Brownian motion and memoryless renewal process (i.e. Poisson point process) of observation ti…
A new DVAE architecture improves channel estimation by incorporating temporal correlations.
problem Improving the estimation of time-varying channels.
method Introducing k-MemoryMarkovVAE (k-MMVAE) architecture to learn temporal correlations.
result The k-MMVAE aided channel estimator outperforms other ML aided estimators.
New CTBNs with clocks allow for non-exponential survival times.
problem Modeling phenomena with non-exponential survival times in continuous time.
method Introduced node-wise clocks to construct graph-coupled semi-Markov chains, enabling non-exponential survival times without auxiliary states.
result Parameter and structure inference algorithms provided, demonstrating advantages over current CTBN extensions.
Modeling T2DM patients' blood glucose with ML for better insulin control.
problem Managing blood glucose levels in T2DM patients with insulin.
method Markov Decision Process (MDP) with model-based reinforcement learning.
result Optimal insulin treatment policy derived from MDP solution.
We characterize value functions in partially observable MDPs as semi-algebraic sets.
problem Understanding feasible value functions in partially observable Markov decision processes.
method Characterization of feasible value functions as semi-algebraic sets defined by polynomial inequalities.
result The feasible set of value functions in POMDPs is a semi-algebraic set, not a polytope as in MDPs.
Exact solution for sparse-reward MDPs with minimal state space dependence.
problem Finding optimal policies for MDPs with sparse rewards and large state spaces.
method Proposes an algorithm with time complexity O(∣R∣3imes∣A∣2) and memory complexity O(∣R∣imes∣A∣) for exact computation. result Exact policy computation without state space dependency for sparse-reward MDPs.
New derivation shows how a three-factor learning rule is derived from Oja's rule.
problem Deriving a three-factor learning rule from Oja's rule.
method Using frame theory to systematically derive EGHR-PCA from Oja's rule.
result A principled derivation of a biologically plausible learning rule.
DeepCTRL integrates rules into deep learning models, allowing flexible control at inference.
problem Lack of flexibility in incorporating rules into deep learning models.
method Integrates rule representations into deep neural networks, enabling flexible control at inference.
result Improves rule verification ratio and accuracy gains at downstream tasks.
New methods prune unpromising rules from KGs, improving scalability and runtime.
problem Scalability issues in walk-based rule learning from KGs.
method Rule Hierarchy Framework (RHF) and Hierarchical Pruning (HPMs).
result Significant reductions in runtime and number of learned rules without compromising predictive performance.
In this paper, the `Approximate Message Passing' (AMP) algorithm, initially developed for compressed sensing of signals under i.i.d. Gaussian measurement matrices, has been extended to a multi-terminal setting (MAMP algorithm). It has been shown that similar to its single terminal counterpart, the behavior of MAMP algo…
Study defines new slant ruled surfaces in Minkowski 3-space.
problem Characterizing non-null ruled surfaces in Minkowski 3-space.
method Introduced new types of non-null ruled surfaces and their characterizations.
result Established relationships between non-null slant ruled surfaces and their striction lines.
Subcartesian spaces follow Leibniz' rule, simplifying differential calculus.
problem Simplifying differential calculus in subcartesian spaces.
method Showed derivations satisfy the chain rule and have maximal integral curves.
result Subcartesian spaces follow Leibniz' rule, simplifying differential calculus.
In this study, we give the relationships between the conical curvatures of ruled surfaces drawn by the unit vectors of the ruling, central normal and central tangent of a regular ruled surface in the Euclidean -space. We obtain the differential equations characterizing slant ruled surfaces and if the reference ruled su…
New framework learns interpretable rule ensembles without sacrificing accuracy.
problem Trade-off between accuracy and interpretability in rule ensembles.
method Introduces local interpretability and a regularizer to promote it, using coordinate descent with local search.
result Learns rule ensembles with fewer rules to explain individual predictions, maintaining comparable accuracy.
R2N learns interpretable rules and literals from numerical features.
problem Lack of expressive vocabulary in rule-based decision models.
method Relational Rule Network (R2N) learns literals and rules end-to-end.
result Learned literals improve prediction accuracy and rule conciseness.
Study ruled surfaces with finite multiplicity, focusing on their curves and singularities.
problem Understanding ruled surfaces with finite multiplicity.
method Analyzing striction curves and singularities of ruled surfaces.
result Geometric meanings of invariants related to ruled surfaces.
Finite subdivision rules in high dimensions are shown to be equivalent to 3D rules.
problem Visualization and construction of high-dimensional subdivision rules.
method Characterized history graphs and defined combinatorial subdivision rules.
result Finite subdivision rules in arbitrary dimensions are combinatorially equivalent to 3D rules.
Paper classifies ruled surfaces in Lorentz-Minkowski space for a specific flow.
problem Classifying ruled surfaces in Lorentz-Minkowski space.
method Examining homothetic self-similar solutions of the inverse mean curvature flow.
result Existence of two classes of non-cylindrical homothetic solitons.
In this study, we define some new types of ruled surfaces called slant ruled surfaces. We give some characterizations for a regular ruled surface to be a slant ruled surface in Euclidean 3- space. We show that if the slant ruled surface is developable then the striction curve is a general helix or a slant helix accordi…
In this paper we use fuzzy systems theory to convert the technical trading rules commonly used by stock practitioners into excess demand functions which are then used to drive the price dynamics. The technical trading rules are recorded in natural languages where fuzzy words and vague expressions abound. In Part I of t…
Subdivision rules create sequences of nested cell structures on CW-complexes, and they frequently arise from groups. In this paper, we develop several tools for classifying subdivision rules. We give a criterion for a subdivision rule to represent a Gromov hyperbolic space, and show that a subdivision rule for a hyperb…
New method calibrates false detection rates in sequential change detection.
problem Challenges in setting time-invariant thresholds for false positives.
method Simulation-based approach to time-varying thresholds.
result Accurately targets desired expected runtime while keeping false positive rate constant.
In this article supervised learning problems are solved using soft rule ensembles. We first review the importance sampling learning ensembles (ISLE) approach that is useful for generating hard rules. The soft rules are then obtained with logistic regression from the corresponding hard rules. In order to deal with the p…
Advances rule-based multi-label classification using conformal prediction.
problem Improving accuracy and decision making in multi-label classification.
method Combines conformal prediction with rule-based learning to provide natural conformity scores and calibrate rule assessments.
result Calibrated conformity scores enhance prediction accuracy and decision making.
We investigate the Heston model with stochastic volatility and exponential tails as a model for the typical price fluctuations of the Brazilian São Paulo Stock Exchange Index (IBOVESPA). Raw prices are first corrected for inflation and a period spanning 15 years characterized by memoryless returns is chosen for the ana…
The Lamarle Formula, given by Kruppa in \cite{Kr}, is known as a relationship between the Gaussian curvature and the distribution parameter of a ruled surface in the surface theory. The ruled surfaces were investigated in 3 different classes with respect to the character of base curves and rulings, \cite{Tu1},\cite{Tu2…
In this paper, we consider non developable ruled surface with spacelike ruling, timelike ruling, respectively. We give the relations between the structure functions with the curvature and torsion of the striction line of the timelike and spacelike non developable ruled surfaces. Also, we have calculated the gaussian an…
The paper proposes a method to optimize rule-based models for better accuracy and interpretability.
problem Developing rule-based models for regression and classification with better accuracy and interpretability.
method Column generation to optimize over an exponentially large space of rules, using integer programming or a heuristic.
result The proposed methods achieve better accuracy-complexity trade-offs than existing rule ensemble algorithms.
Generative models learn rules at different timescales, revealing a 'innovation window'.
problem Generative models' convergence to empirical training distribution rather than population distribution.
method Rule-valid synthetic tasks, analyzing τrule and τmem across training timescales. result The 'innovation window' widens with increasing dataset size and narrows with rule complexity.