Researchers identify graph components for unicellular collections.
problem Understanding connected components of surgery graph for unicellular collections.
method Group-theoretic approach involving mapping class group action.
result Connected components enumerated by a homological invariant.
The article explores the mapping class group using unicellular maps and provides filtrations.
problem Understanding the structure of the mapping class group.
method Using unicellular maps and surgeries, the article describes the mapping class group.
result Provides filtrations of the mapping class group.
Maps with a single face converge to hyperbolic surfaces in large genus.
problem Understanding geometric properties of high genus maps.
method Analyzing uniformly random maps and their convergence to hyperbolic surfaces.
result Lengths of simple cycles converge to a Poisson process.
Research tackles alliance formation in many-player zero-sum games, showing reinforcement learning fails but a contract mechanism can help.
problem Tackles the challenge of alliance formation in many-player zero-sum games.
method Demonstrates the social dilemma aspect of alliance formation, introduces a contract mechanism to augment reinforcement learning.
result Naïve reinforcement learning fails to form alliances, but a contract mechanism can help.
Study collective pricing and hedging with admissible risk exchanges forming a finitely generated convex cone.
problem Collective pricing and hedging with exchanges forming a finitely generated convex cone.
method Extend collective First Fundamental Theorem of Asset Pricing and pricing-hedging duality.
result No collective arbitrage implies the closedness of the aggregate feasibility cone.
Measures collectivity in financial covariances and correlations to reveal trends and precursors.
problem Capturing collective motion in financial markets to predict trends and precursors.
method Measures collectivity using the largest eigenvalue and average sector collectivity.
result Identifies collective signals around major financial events and captures trends in covariances and correlations.
Study finds strict collection policies improve portfolio quality of microfinance banks.
problem Improving portfolio quality of microfinance banks through better credit collection policies.
method Multi-stage sampling, regression analysis, descriptive statistics.
result Collection policy has a higher effect on portfolio quality.
Generative model predicts NFT collection transactions based on early history.
problem Predict future transactions of newly minted NFT collections.
method Unsupervised learning to extract contexts, then generate future transactions.
result Projected market value of new NFT collections.
The paper extends collective arbitrage concepts to multi-agent markets with cooperation.
problem Understanding collective market completeness and pricing in multi-agent systems.
method Develops new techniques and theorems to establish collective pricing-hedging duality and collective replication.
result Established a Second Fundamental Theorem of Asset Pricing in cooperative multi-agent settings.
Study shows cooperation can reduce investment risk and price gaps.
problem Investment risk and price gaps in cooperative markets.
method Introduced Collective Arbitrage and Collective Super-replication, established asset pricing theorems.
result Reduction of price intervals through collective super-replication.
Active data collection improves convergence rates in operator learning.
problem Improving convergence rates in operator learning with linear target and stochastic input.
method Active data collection strategies with mean-zero stochastic process and continuous covariance kernels.
result Achieves arbitrarily fast error convergence rates with eigenvalue decay of covariance kernels.
A universal collection of 4 invariants improves neural network accuracy for molecular dynamics.
problem Improving accuracy of neural networks in molecular dynamics.
method Developed a universal collection of 4 smooth scalar invariants on M(3) x M(3) and evaluated their effectiveness in a PONITA neural network architecture.
result Using a universal collection of invariants significantly improves neural network accuracy.
This study examines how learning algorithms affect collective action in machine learning.
problem The impact of collective action on machine learning is limited when not considering the choice of learning algorithms.
method Focuses on distributionally robust optimization and stochastic gradient descent, analyzing their effects on collective success.
result The choice of learning algorithm significantly impacts the effective size and success of a collective in machine learning.
This review explores the use of machine learning in discovering collective variables for biomolecular dynamics.
problem Understanding the conformational dynamics and molecular recognition in biomolecules.
method Statistical analysis of high-dimensional spatiotemporal data generated from molecular dynamics simulations.
result Machine learning algorithms can be used to discover abstract collective variables that describe biomolecular dynamics.
CUDC collects diverse data for offline RL by predicting future states.
problem Challenges in collecting task-agnostic data for offline RL.
method Adaptive temporal distances for curiosity-driven data collection.
result CUDC outperforms existing unsupervised methods in offline RL tasks.
Collectives can manipulate learning platforms by coordinated data submission, requiring strategic assessments and algorithms.
problem Collectives can influence learning platforms by altering data, posing risks and requiring strategic planning.
method Developed a theoretical and algorithmic framework to understand and mitigate collective manipulation of learning platforms.
result Demonstrated the need for strategic assessments and implementable coordination algorithms to prevent collective manipulation.
Post-ADC inference corrects bias in statistical inference after active data collection.
problem Bias in inference after active data collection.
method Post-ADC inference framework that corrects bias from both ADC process and data-driven target construction.
result Valid inference for data collected by SMBO methods like GP-UCB and TPE.
Study shows small groups can influence machine learning algorithms.
problem How small groups can influence machine learning algorithms deployed on digital platforms.
method Proposed a theoretical model and conducted experiments on a large-scale language model.
result Small groups can exert significant control over machine learning algorithms.
The study examines collective behavior in banking sectors across mature and emerging markets.
problem Understanding collective behavior in banking sectors across different market types.
method Applied Random Matrix Theory (RMT) to analyze the banking sectors of 4 world stock markets.
result Mature markets exhibit higher collective behavior compared to emerging markets.
Optimal online data collection for semiparametric inference reduces regret.
problem Sequential data collection decisions for efficient estimation under budget constraints.
method Online Moment Selection framework; Explore-then-Commit and Explore-then-Greedy policies.
result Online data collection policies achieve zero regret relative to an oracle policy.
We address the collective matrix completion problem of jointly recovering a collection of matrices with shared structure from partial (and potentially noisy) observations. To ensure well--posedness of the problem, we impose a joint low rank structure, wherein each component matrix is low rank and the latent space of th…
New algorithm for collective Gaussian hidden Markov models inference.
problem Inference of collective Gaussian hidden Markov models from aggregate data.
method Collective Gaussian forward-backward algorithm, extending Sinkhorn belief propagation.
result Convergence guarantee and applicability to single individual Kalman filter.
New algorithms reduce costly feature collection in bandits.
problem Costly feature collection in contextual bandits.
method Proposes algorithms avoiding unnecessary feature collection.
result Strong regret guarantees maintained with reduced feature collection.
We determine the extent to which the collection of Γ-Euler-Satake characteristics classify closed 2-orbifolds. In particular, we show that the closed, connected, effective, orientable 2-orbifolds are classified by the collection of Γ-Euler-Satake characteristics corresponding to free or free abelian Γ and are not…
Data collection is a major bottleneck in machine learning and an active research topic in multiple communities. There are largely two reasons data collection has recently become a critical issue. First, as machine learning is becoming more widely-used, we are seeing new applications that do not necessarily have enough …
Adapting policy learning for data collected from evolving systems.
problem Challenges in learning optimal policies from adaptively collected data.
method Proposes an algorithm based on generalized augmented inverse propensity weighted (AIPW) estimators to control worst-case estimation variance.
result Achieves minimax rate optimal regret guarantees even with diminishing exploration.
Learning the activities of animals is important for the purpose of monitoring their welfare vis a vis their behaviour with respect to their environment and conspecifics. While previous works have largely focused on activity recognition in a single animal, little or no work has been done in learning the collective behav…
Improved disability insurance model with collective health claims.
problem Enhance disability insurance model with collective health claims.
method Expand classic semi-Markov model with collective health claims, solve many-body problem using mean-field approach.
result Mean-field approach simplifies complex model into a transparent pricing method.
We derive a class of macroscopic differential equations that describe collective adaptation, starting from a discrete-time stochastic microscopic model. The behavior of each agent is a dynamic balance between adaptation that locally achieves the best action and memory loss that leads to randomized behavior. We show tha…
Adaptive collection of data is commonplace in applications throughout science and engineering. From the point of view of statistical inference however, adaptive data collection induces memory and correlation in the samples, and poses significant challenge. We consider the high-dimensional linear regression, where the s…
The challenge of efficiently identifying anomalies in data sequences is an important statistical problem that now arises in many applications. Whilst there has been substantial work aimed at making statistical analyses robust to outliers, or point anomalies, there has been much less work on detecting anomalous segments…
Let Ω=(ωj)j∈I be a collection of pairwise non-isotopic simple closed curves on the closed, orientable, genus g surface Sg, such that ωi and ωj intersect exactly once for i=j. It was recently demonstrated by Malestein, Rivin, and Theran that the cardinality of such a collection is no mo…
Collective classification has been intensively studied due to its impact in many important applications, such as web mining, bioinformatics and citation analysis. Collective classification approaches exploit the dependencies of a group of linked objects whose class labels are correlated and need to be predicted simulta…
Unified method for balancing simulation and data collection.
problem Finding optimal solutions with uncertain inputs.
method Bayesian Information Collection and Optimisation (BICO) procedure.
result Algorithm automatically determines optimal balance between optimisation and data collection.
New guarantees for ERM with adaptively collected data.
problem Failure of ERM guarantees with adaptively collected data.
method Importance sampling weighted ERM algorithm with maximal inequality.
result First generalization guarantees and fast convergence rates for adaptively collected data.
Proposes a method to optimize budget allocation for collecting and analyzing streaming data.
problem Optimizing resource allocation for collecting and analyzing streaming data.
method Formulates optimization problems to allocate budgets for collecting input data and running simulations, characterizes asymptotic behavior of performance estimators, and develops a multi-stage simultaneous budget allocation procedure.
result Demonstrates competitive performance of the proposed procedure through numerical studies.
Deep learning method clusters multi-view data matrices.
problem Clustering heterogeneous relational data matrices.
method Deep collective matrix tri-factorization (DCMTF).
result Discover latent clusters across input matrices and their associations.
We present a simple model of firm rating evolution. We consider two sources of defaults: individual dynamics of economic development and Potts-like interactions between firms. We show that such a defined model leads to phase transition, which results in collective defaults. The existence of the collective phase depends…
Advances neural tri-factorization for clustering and discordance analysis of multi-typed data.
problem Challenges in analyzing heterogeneous, multimodal relational data.
method Deep collective matrix tri-factorization for spectral clustering and cluster association learning.
result Demonstrates efficacy over previous non-neural approaches in clustering and discordance analysis.
We address challenges in estimating parameters from adaptively collected data.
problem Estimating parameters from data collected adaptively leads to non-normal asymptotic distributions.
method We develop semi-parametric estimators that account for adaptivity in data collection.
result Our estimators are asymptotically normal under certain conditions.
Understanding biological network dynamics is a fundamental issue in various scientific and engineering fields. Network theory is capable of revealing the relationship between elements and their propagation; however, for complex collective motions, the network properties often transiently and complexly change. A fundame…
Study reveals subdominant correlations in motorway network dynamics.
problem Understanding correlations between motorway sections for network functionality.
method Spectral analysis of correlation matrix to identify subdominant collectivities.
result Subdominant collectivities affect large parts of the traffic network.
Gradient boosting of regression trees is a competitive procedure for learning predictive models of continuous data that fits the data with an additive non-parametric model. The classic version of gradient boosting assumes that the data is independent and identically distributed. However, relational data with interdepen…
Decentralized mechanism for collective predictions without sharing data or models.
problem Making predictions jointly among multiple parties without sharing data or models.
method Inspired by social science consensus-making, a decentralized mechanism for test-time collective predictions.
result Our mechanism converges to inverse meansquared-error weighting in the large-sample limit and achieves significant gains over classical model averaging.
This research improves debt collection strategies using advanced machine learning.
problem Accurate estimation of propensity to pay and cashflow for optimal debt collection.
method Developed a machine learning framework with pre-processing and model selection.
result The proposed model outperforms current industry strategies.
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.
Due to their ubiquitous and pervasive nature, Wi-Fi networks have the potential to collect large-scale, low-cost, and disaggregate data on multimodal transportation. In this study, we develop a semi-supervised deep residual network (ResNet) framework to utilize Wi-Fi communications obtained from smartphones for the pur…
Bayesian method infers local rules for collective animal movement.
problem Learn local rules governing long-term group behaviors.
method Bayesian Inverse Reinforcement Learning with Linearly-Solvable Markov Decision Process.
result Recover true costs and find value of collective movement.