Train deep neural networks one layer at a time for faster training and flexibility.
problem Training deep neural networks efficiently and with diverse layers.
method Train layers sequentially, mapping input data forward through each layer.
result Achieved state-of-the-art accuracy on MNIST dataset for convolutional neural networks.
A new framework for deep learning using decision trees.
problem Improving performance of deep learning models.
method Training layers one at a time, adapting as needed, and using decision trees.
result FTDRF achieves good performance on the MNIST dataset.
Breiman's two cultures reconciled through blending statistical thinking.
problem Tension between parametric statistical and machine learning approaches.
method Establishing a link between parametric statistical and machine learning frameworks.
result Integrated statistical thinking can bridge the gap between two cultures.
Thinking LLMs struggle with stock prediction, especially as data complexity increases.
problem Evaluating the performance of 'thinking' LLMs in stock prediction, especially under varying levels of cross-sectional complexity.
method Rolling 48m/1m walk-forward evaluation, comparing direct LLMs, TLLMs, and classical learners on cross-sectional ranking loss, MSE, and backtests with transaction costs.
result TLLMs' ranking quality deteriorates as cross-sectional complexity grows, while direct LLMs remain stable.
Breiman's paper sparked debate on the future of statistics and machine learning.
problem The tension between traditional statistical modeling and model-free machine learning approaches.
method Discussion of the implications of machine learning's success and the need for new inferential approaches.
result The importance of understanding 'why' and 'if' questions in machine learning is now recognized.
New method uses reverse thinking to correct machine learning errors.
problem Machine learning methods form inertial thinking schemes that can lead to errors when testing data are vastly different.
method Proposes a new method that uses reverse thinking to correct illusion inertial thinking in machine learning.
result Increases the generalization ability of machine learning methods.
Automatic detection of reflective thinking in math problem solving using body movement data.
problem Detecting reflective thinking in children's mathematical problem solving.
method WeDraw-1 Movement Dataset, Long Short-Term Memory neural networks, end-to-end detection.
result Average F1 scores of 0.73 for automatic detection and 0.79 for end-to-end detection of reflective thinking.
CausalGame benchmarks LLM agents' causal thinking in games.
problem Evaluating causal thinking in AI Scientists with LLMs.
method Interactive games with 14 scenarios incorporating selection bias, measurement error, and hidden confounders.
result None of the 30 LLM agents demonstrated reliable causal thinking, with the best model achieving only 68.0% survival.
Paper tackles conditional learning between different domains.
problem Learning conditional distribution between input and output domains.
method Cooperative training of fast and slow thinking models.
result Jointly trained models improve conditional learning tasks.
This paper uses counterfactual thinking to improve multi-agent reinforcement learning.
problem Improving decision-making in multi-agent environments.
method Proposes a deep reinforcement learning model with counterfactual thinking to generate and evaluate multiple actions.
result Counterfactual thinking enhances agents' performance in multi-agent environments, leading to higher rewards and fair competition.
The seriousness of the current crisis urgently demands new economic thinking that breaks the austerity vs. deficit spending circle in economic policy. The core tenet of the paper is that the most important problems that natural and social science are facing today are inverse problems, and that a new approach that goes …
The paper critiques existing uncertainty concepts and proposes a new decision-theoretic approach.
problem Incoherence in existing discussions of aleatoric and epistemic uncertainty.
method Decision-theoretic perspective that relates uncertainty, predictive performance, and statistical dispersion.
result Popular information-theoretic quantities can be poor estimators but still useful for guiding data acquisition.
A new reinforcement learning method for robots thinking and moving simultaneously.
problem Concurrent control in robotic systems where actions must be decided while the system is still evolving.
method Continuous-time Bellman equations, discretization aware of system delays, and architectural extension to deep reinforcement learning.
result The method successfully handles tasks requiring simultaneous decision-making and action execution.
The paper encourages Kleinian group thinking for higher rank Lie groups.
problem No specific problem stated; encouraging new thinking.
method Discussion of Kleinian group ideas applied to higher rank Lie groups.
result Encouragement to think about higher rank Lie groups using Kleinian group theory.
Turing test relevance questioned in age of AI.
problem Relevance of Turing test in AI age.
method Examining cultural and technological context.
result Turing test may not fully capture AI capabilities.
New method shows how order of gradient updates impacts stability and convergence in deep learning.
problem Training deep learning models can be unstable and computationally expensive.
method Theoretical analysis and experiments with backward-SGD.
result The order of gradient updates affects stability and convergence, leading to improved performance.
Causal thinking improves healthcare decisions from EHRs.
problem Shortcuts in data lead to biased healthcare decisions.
method Step-by-step framework for valid decision making from EHRs.
result Valid decision making requires careful analysis of EHR data.
Simplified proof of a famous geometry result for students.
problem Mostow Rigidity in geometry and topology
method Self-contained, accessible proof for grad students
result Clean and analytically light proof accessible to students
The paper explores how innovative financing solutions boost Moroccan businesses' performance.
problem Market volatility, ecological transitions, and technological change pose challenges to business sustainability.
method Examines innovative financing solutions like venture capital, green finance, crowdfunding, and blockchain.
result Embracing innovative financial strategies can transform business challenges into opportunities.
Study shows activist board representation improves Japanese companies' performance.
problem Lack of innovation and improvement in Japanese companies.
method Examined two Japanese companies with activist board representation, analyzing performance metrics.
result Companies with activist board representation experienced significant improvements in stock returns and operational metrics.
Model learns brevity by exposing to easy problems, improving efficiency without explicit length penalties.
problem Excessive verbosity in step-by-step reasoning models trained with RLVR.
method Retaining and up-weighting moderately easy problems as implicit length regularizers.
result Model generates solutions that are, on average, nearly twice as short without explicit length penalties.
Discussing the need for explainable AI in various fields.
problem The lack of transparency in AI and ML methods.
method Discussion of explainable AI from a grounded perspective.
result Highlighting the importance of explainable AI in fields like health and justice.
New framework for RL with opponents, improving learning outcomes.
problem Learning in RL with potential adversaries.
method Threatened Markov Decision Processes (TMDPs) and level-k thinking.
result Improved RL performance by accounting for adversaries.
DGP learns speech recognition by modeling complex relationships between utterances.
problem Modeling complex relationships in speech recognition without relational data.
method Bayesian nonparametric deep learning method (DGP) that generates infinite probabilistic graphs.
result DGP successfully infers relationships among utterances without relational data during training.
The use of the trading halts is a practice common to all markets. However, the advantages and the disadvantages of the measurements are regularly discussed. The partisans think that the trading suspensions or the price limits make it possible to the investors to have time to react to the new information. The detractors…
Recent progress in artificial intelligence (AI) has renewed interest in building systems that learn and think like people. Many advances have come from using deep neural networks trained end-to-end in tasks such as object recognition, video games, and board games, achieving performance that equals or even beats humans …
Simple model outperforms neural networks on language understanding tasks.
problem Neural networks struggle with creating novel expressions from familiar ones.
method Attention-inspired modification of a baseline model, focusing on sequential thinking and acting.
result Simple model achieves good performance on gSCAN tasks, validating the benchmark.
Paper introduces TMDPs for RL in adversarial settings.
problem Adversaries interfering with reward in RL scenarios.
method TMDPs and level-k thinking scheme. result Benefits of considering adversaries in RL learning.
Deep neural networks create surrogate models for high-dimensional uncertainty quantification.
problem Uncertainty quantification for systems with many input parameters is computationally infeasible.
method Constructing a cheap-to-evaluate surrogate model using deep neural networks (DNN) to replace a forward model solver.
result DNN surrogate models can learn a map between an arbitrary snapshot of the diffusion field and the response, overcoming traditional SPDE problem constraints.
New technique reduces language biases in large language models.
problem Gap between language and thought in large language models.
method Proposes Language-of-Thoughts (LoT) technique to adjust order and tokens.
result Significantly reduces language biases and improves reasoning tasks.
TSDS framework reduces edge LLM agent compute by 43%-73% while maintaining safety and reliability.
problem Managing reasoning budget and uncertainty in edge LLM agents.
method Integrates a lightweight convergence probe and a perplexity-based deferral rule calibrated via multi-objective LTT.
result Reduces per-episode thinking compute by 43%-73% over deferral-only baselines.
Compendium simplifies Ehreshmann theory for physicists.
problem Complexity in Ehreshmann theory of connection.
method Comprehensive review and simplification of theory.
result Simplified theory accessible to young relativists.
A deep model learns to stop early based on variational stopping policy.
problem Varying optimal depth for different inputs in deep architectures.
method A steerable architecture learns a feed-forward deep model and a variational stopping policy together.
result The learned deep model and stopping policy improve diverse tasks.
Can we manipulate multiple deep neural networks simultaneously?
problem Selective fooling of multiple machine learning systems.
method Formulated as a novel optimization problem.
result It is easy to selectively manipulate multiple MNIST classifiers simultaneously.
Research suggests using deep learning for better recommendation systems.
problem Recommender systems rely on proxies for A/B testing, leading to random success.
method Advocates for using deep learning to improve recommendation performance.
result Deep learning can potentially optimize reward in recommendation systems.
In this paper we study n-composition series of affine manifolds. One composition series are classified using gerbe theory. It is natural to think that n-composition series must be classified using n-gerbe theory. In the last section of this, we propose a notion of abelian n-gerbe theory
The paper converts metric bounds to distance function Hölder bounds and proves compactness theorems.
problem Proving geometric stability results with scalar curvature bounds.
method Transforming Lp bounds to Hölder bounds for distance functions. result Compactness theorems and convergence guarantees for Riemannian manifolds.
New models explain residual and dilated dense neural networks using sparse coding.
problem Lack of theoretical understanding of residual and dilated dense neural networks.
method Proposed Res-CSC and MSD-CSC models, derived mathematical relationships, implemented ISTA.
result Mathematical understanding of residual and dilated dense neural networks.
We argue that the present crisis and stalling economy continuing since 2007 are rooted in the delusionary belief in policies based on a "perpetual money machine" type of thinking. We document strong evidence that, since the early 1980s, consumption has been increasingly funded by smaller savings, booming financial prof…
DRNets combine deep learning and reasoning for complex tasks.
problem Solving complex tasks, especially in scientific discovery, with limited supervision.
method DRNets integrate logic and neural network optimization to encode structured latent spaces constrained by prior knowledge.
result DRNets outperform state-of-the-art models in scientific discovery tasks, recovering more precise crystal structures.
Open geometry puzzles keep the author engaged.
problem Open problems in geometry that challenge the author.
method Collection of open problems based on puzzle-charm.
result No spare hands in solving the problems.
We prove new results on existence of solutions for the prescribed gaussian curvature problem on the euclidean sphere S^2. Those results are achieved by relating this problem with the holomorphic triples theory on Riemann surfaces. We think this approach might be applied to study some other semi-linear elliptic equation…
Random neural networks produce functions with a number of knots equal to the number of neurons.
problem Understanding why neural networks with many parameters do not overfit early in training.
method Analyzing random scalar-input feed-forward rectified linear unit architectures, showing they are random linear splines.
result The number of knots in random neural networks is equal to the number of neurons, to very close approximation.
New method uses causal thinking to make AI fairer decisions.
problem Designing fair machine learning models that treat equal individuals equally and unequals unequally.
method Rank-preserving interventional distributions and warping method.
result Warping method effectively identifies discriminated individuals and mitigates unfairness.
We prove some general results about quasi-actions on trees and define Property (QFA), which is analogous to Serre's Property (FA), but in the coarse setting. This property is shown to hold for a class of groups, including SL(n,Z) for n≥3. We also give a way of thinking about Property (QFA) by breaking it down …
Undecidability proved for DG algebras problems.
problem Stable isomorphism, quasi-isomorphism, and Morita equivalence problems for semifree DG algebras.
method Essentially autonomous solutions by Gemini Deep Think and Aletheia.
result Proved undecidability of problems for semifree DG algebras.
TAMA uses LMMs to detect and interpret anomalies in time series data with few labels.
problem Challenges in manual feature engineering and extensive labeled training data for TSAD.
method Leverages LMMs to convert time series into visual formats for few-shot in-context learning.
result Consistently outperforms state-of-the-art methods in TSAD tasks.
Bayesian model helps doctors diagnose by mixing past cases.
problem Doctors rely on past experience for diagnosis.
method Developed a novel mathematical model to mimic case-based reasoning.
result Yields predictive accuracy and insight into medical data.